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/S1064562414010165zbMATH Open1306.05108MaRDI QIDQ403932FDOQ403932
Authors: E. I. Ponomarenko, Andrei M. Raigorodskii 
Publication date: 29 August 2014
Published in: Doklady Mathematics (Search for Journal in Brave)
Recommendations
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- 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
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the VC-dimension of uniform hypergraphs
- On the chromatic number of a space with forbidden equilateral triangle
Cites Work
- 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 the chromatic numbers of spheres in \(\mathbb R^n\)
- On a bound in Borsuk's problem
- The realization of distances within sets in Euclidean space
- On the chromatic numbers of spheres in Euclidean spaces
- The complete intersection theorem for systems of finite sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Counterexamples to Borsuk's conjecture on spheres of small radius
Cited In (18)
- On the Frankl-Rödl theorem
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- 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
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- On a Frankl-Wilson theorem
- Improvements of the Frankl-Rödl theorem and geometric consequences
- New upper bound for the chromatic number of a random subgraph of a distance graph
- Hamiltonian paths in distance graphs
- On lower bounds for the chromatic number of sphere
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the chromatic number of a space with forbidden equilateral triangle
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- On the stability of the Erdös-Ko-Rado theorem
- On lower bounds for the chromatic number of spheres
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- On the chromatic numbers of some distance graphs
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
- 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
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403932)
