|
1 |
On Colourings of Hypergraphs Without Monochromatic Fano Planes Lefmann, Hanno. - Berlin : Humboldt-Universität zu Berlin, 2023
|
|
|
2 |
An exponential-type upper bound for Folkman numbers Enthalten in Combinatorica 10.5.2016: 1-18
|
|
|
3 |
Perfect matchings in ε-regular [epsilon-regular] graphs and the blow up lemma Rödl, Vojtěch. - Bielefeld : Sonderforschungsbereich 343, 1999
|
|
|
4 |
Proper Bounded Edge-Colorings Dortmund : Universitätsbibliothek Dortmund, 1998
|
|
|
5 |
An alternate proof of Szemerédi's cube Lemma using extremal hypergraphs Gunderson, David S.. - Bielefeld : Sonderforschungsbereich 343, 1995
|
|
|
6 |
Extremal problems for affine cubes of integers Gunderson, David S.. - Bielefeld : Sonderforschungsbereich 343, 1995
|
|
|
7 |
The minimum independence number for designs Enthalten in Combinatorica Bd. 15, Nr. 2, date:6.1995: 175-185
|
|
|
8 |
On Erdős-Rado numbers Enthalten in Combinatorica Bd. 15, Nr. 1, date:3.1995: 85-104
|
|
|
9 |
A fast approximation algorithm for computing the frequencies of subgraphs in a given graph Duke, Richard A.. - Dortmund : Dekanat Informatik, Univ., 1994
|
|
|
10 |
Multicolored subsets in colored hypergraphs Lefmann, Hanno. - Dortmund : Dekanat Informatik, Univ., 1993
|
|