Pages that link to "Item:Q1643771"
From MaRDI portal
The following pages link to On a bound in extremal combinatorics (Q1643771):
Displaying 13 items.
- On the chromatic numbers of some distance graphs (Q1709876) (← links)
- Bounds on Borsuk numbers in distance graphs of a special type (Q2044127) (← links)
- On a Frankl-Wilson theorem (Q2190926) (← links)
- Estimate of the number of edges in special subgraphs of a distance graph (Q2191968) (← links)
- A generalization of Kneser graphs (Q2191979) (← links)
- On the chromatic numbers corresponding to exponentially Ramsey sets (Q2202680) (← links)
- Exponentially Ramsey sets (Q2278704) (← links)
- Equitable colorings of hypergraphs with few edges (Q2309544) (← links)
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) (Q2313252) (← links)
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) (Q2313626) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)
- On a Frankl-Wilson theorem and its geometric corollaries (Q6621259) (← links)
