Pages that link to "Item:Q2262987"

The following pages link to New estimates in the problem of the number of edges in a hypergraph with forbidden intersections (Q2262987):

Displaying 16 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 a bound in extremal combinatorics (Q1643771) (← links)
• On the chromatic numbers of rational spaces (Q1646347) (← links)
• On the number of edges of a uniform hypergraph with a range of allowed intersections (Q2190888) (← links)
• On a Frankl-Wilson theorem (Q2190926) (← links)
• Exponentially Ramsey sets (Q2278704) (← 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 bound for the chromatic number of a random subgraph of a distance graph (Q2352580) (← links)
• On chromatic numbers of close-to-Kneser distance graphs (Q2364457) (← links)
• Independence numbers and chromatic numbers of the random subgraphs of some distance graphs (Q3466410) (← links)
• On the Frankl–Rödl theorem (Q4613521) (← links)