On a Frankl-Wilson theorem and its geometric corollaries

Cites Work

Transitive sets in Euclidean Ramsey theory
The chromatic number of space with forbidden regular simplex
On the maximal number of edges in a uniform hypergraph with one forbidden intersection
Intersection theorems with geometric consequences
On a bound in extremal combinatorics
Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
On a Frankl-Rödl theorem and its geometric corollaries
Distance graphs with large chromatic numbers and small clique numbers
Distance graphs with large chromatic number and arbitrary girth
New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
Exponentially Ramsey sets
Improved Frankl-Rödl theorem and some of its geometric consequences
On the chromatic number of a space with a forbidden regular simplex
Lower bounds for the chromatic numbers of distance graphs with large girth
Improvements of the Frankl-Rödl theorem and geometric consequences
Turán-type results for distance graphs in an infinitesimal plane layer
Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
Frankl-Rödl-type theorems for codes and permutations
Coloring Distance Graphs and Graphs of Diameters
Research Problems in Discrete Geometry
The Mathematical Coloring Book
Forbidden Intersections
On the chromatic number of a space
On the chromatic number of an infinitesimal plane layer
On the Frankl–Rödl theorem
Combinatorial Geometry and Coding Theory*
On the chromatic number of a space with forbidden equilateral triangle
The realization of distances within sets in Euclidean space
On the chromatic numbers of small-dimensional Euclidean spaces