Pages that link to "Item:Q492207"
From MaRDI portal
The following pages link to Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207):
Displayed 10 items.
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- On a bound in extremal combinatorics (Q1643771) (← links)
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← links)
- On a Frankl-Rödl theorem and its geometric corollaries (Q1690051) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
- Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552) (← links)
- Improvements of the Frankl-Rödl theorem and geometric consequences (Q2411792) (← links)
