Improved Frankl-Rödl theorem and some of its geometric consequences
From MaRDI portal
Publication:2314149
DOI10.1134/S0032946018020047zbMath1419.05214OpenAlexW2883848449MaRDI QIDQ2314149
Publication date: 19 July 2019
Published in: Problems of Information Transmission (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0032946018020047
Related Items (11)
A recursive Lovász theta number for simplex-avoiding sets ⋮ On a Frankl-Wilson theorem ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ Monochromatic equilateral triangles in the unit distance graph ⋮ Exponentially Ramsey sets ⋮ On the partition of an odd number into three primes in a prescribed proportion ⋮ A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ Counterexamples to Borsuk's conjecture with large girth
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
- 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
- All regular polytopes are Ramsey
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Intersection theorems with geometric consequences
- On a bound in extremal combinatorics
- Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets
- Distance graphs with large chromatic number and arbitrary girth
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On the chromatic number of a space with a forbidden regular simplex
- Lower bounds for the chromatic numbers of distance graphs with large girth
- The Difference Between Consecutive Primes, II
- Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
- Coloring Distance Graphs and Graphs of Diameters
- A Partition Property of Simplices in Euclidean Space
- All Triangles are Ramsey
- Forbidden Intersections
- Permutation Groups in Euclidean Ramsey Theory
- On the chromatic number of a space
- The chromatic number of the plane is at least 5
- On the Frankl–Rödl theorem
- Combinatorial Geometry and Coding Theory*
- On the chromatic number of a space with forbidden equilateral triangle
- The realization of distances within sets in Euclidean space
This page was built for publication: Improved Frankl-Rödl theorem and some of its geometric consequences
