Pages that link to "Item:Q403932"
From MaRDI portal
The following pages link to An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges (Q403932):
Displayed 13 items.
- Improvements of the Frankl-Rödl theorem on the number of edges of a hypergraph with forbidden intersections, and their consequences in the problem of finding the chromatic number of a space with forbidden equilateral triangle (Q492207) (← links)
- On the stability of the Erdös-Ko-Rado theorem (Q498190) (← links)
- Hamiltonian paths in distance graphs (Q745636) (← links)
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection (Q892713) (← links)
- On lower bounds for the chromatic number of sphere (Q892738) (← 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)
- On lower bounds for the chromatic number of spheres (Q2313602) (← links)
- Improved Frankl-Rödl theorem and some of its geometric consequences (Q2314149) (← links)
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs (Q2342346) (← links)
- New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs (Q3466410) (← links)
- On the Frankl–Rödl theorem (Q4613521) (← links)