An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
From MaRDI portal
(Redirected from Publication:403932)
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
- scientific article; zbMATH DE number 5935733 (Why is no real title available?)
- scientific article; zbMATH DE number 5218478 (Why is no real title available?)
- A counterexample to Borsuk’s conjecture
- Counterexamples to Borsuk's conjecture on spheres of small radius
- Intersection theorems with geometric consequences
- On a bound in Borsuk's problem
- On the chromatic number of a space
- On the chromatic numbers of spheres in Euclidean spaces
- On the chromatic numbers of spheres in \(\mathbb R^n\)
- The complete intersection theorem for systems of finite sets
- The complete nontrivial-intersection theorem for systems of finite sets
- The realization of distances within sets in Euclidean space
Cited in
(18)- 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
- Improved Frankl-Rödl theorem and some of its geometric consequences
- On the chromatic number of a space with forbidden equilateral triangle
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- On the stability of the Erdös-Ko-Rado 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 lower bounds for the chromatic number of sphere
- New upper bound for the chromatic number of a random subgraph of a distance graph
- On the Frankl-Rödl theorem
- On lower bounds for the chromatic number of spheres
- Independence numbers and chromatic numbers of the random subgraphs of some distance graphs
- Hamiltonian paths in distance graphs
- Improvements of the Frankl-Rödl theorem and geometric consequences
- On a Frankl-Wilson theorem
- On the chromatic numbers of some distance graphs
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
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)
