Pages that link to "Item:Q2364552"
From MaRDI portal
The following pages link to Lower bounds for the chromatic numbers of distance graphs with large girth (Q2364552):
Displaying 9 items.
- The chromatic number of space with forbidden regular simplex (Q679877) (← links)
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets (Q1646366) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
- Improvements of the Frankl-Rödl theorem and geometric consequences (Q2411792) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- On a Frankl-Wilson theorem and its geometric corollaries (Q6621259) (← links)
