An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
From MaRDI portal
Publication:403932
DOI10.1134/S1064562414010165zbMath1306.05108MaRDI QIDQ403932
E. I. Ponomarenko, Andrei M. Raigorodskii
Publication date: 29 August 2014
Published in: Doklady Mathematics (Search for Journal in Brave)
Related Items (13)
Independence numbers and chromatic numbers of the random subgraphs of some distance graphs ⋮ On the maximal number of edges in a uniform hypergraph with one forbidden intersection ⋮ On lower bounds for the chromatic number of sphere ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On the chromatic numbers of some distance graphs ⋮ On the Frankl–Rödl theorem ⋮ 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 ⋮ On the stability of the Erdös-Ko-Rado theorem ⋮ Hamiltonian paths in distance graphs ⋮ On lower bounds for the chromatic number of spheres ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ 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 ⋮ New upper bound for the chromatic number of a random subgraph of a distance graph
Cites Work
- Unnamed Item
- Unnamed Item
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- On the chromatic numbers of spheres in Euclidean spaces
- Counterexamples to Borsuk's conjecture on spheres of small radius
- The complete intersection theorem for systems of finite sets
- Intersection theorems with geometric consequences
- The complete nontrivial-intersection theorem for systems of finite sets
- A counterexample to Borsuk’s conjecture
- On the chromatic number of a space
- On a bound in Borsuk's problem
- The realization of distances within sets in Euclidean space
This page was built for publication: An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
