Pages that link to "Item:Q892713"
From MaRDI portal
The following pages link to On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713):
Displayed 10 items.
- On chromatic numbers of nearly Kneser distance graphs (Q334403) (← links)
- On a bound in extremal combinatorics (Q1643771) (← 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)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)