The following pages link to On the Frankl–Rödl theorem (Q4613521):
Displaying 14 items.
- Chromatic numbers of distance graphs without short odd cycles in rational spaces (Q2037721) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- On the partition of an odd number into three primes in a prescribed proportion (Q2282839) (← links)
- A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space (Q2309559) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)
- A recursive Lovász theta number for simplex-avoiding sets (Q5097318) (← links)
- The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances (Q6048774) (← links)
- On a Frankl-Wilson theorem and its geometric corollaries (Q6621259) (← links)
