Pages that link to "Item:Q2411792"
From MaRDI portal
The following pages link to Improvements of the Frankl-Rödl theorem and geometric consequences (Q2411792):
Displayed 14 items.
- On a bound in extremal combinatorics (Q1643771) (← links)
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
- Chromatic numbers of some distance graphs (Q2191956) (← 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)
- Distance graphs with large chromatic number and without cliques of given size in the rational space (Q2282833) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- On lower bounds for the chromatic number of spheres (Q2313602) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- Refinement of lower bounds of the chromatic number of a space with forbidden one-color triangles (Q2314097) (← links)
- The number of edges in induced subgraphs of some distance graphs (Q2314127) (← links)
- Counterexamples to Borsuk's conjecture with large girth (Q2334928) (← links)