On the Frankl–Rödl theorem

DOI10.1070/IM8630zbMath1404.05058OpenAlexW2811161060MaRDI QIDQ4613521

A. A. Sagdeev

Publication date: 1 February 2019

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im8630

zbMATH Keywords

chromatic numberdistance graphgirthEuclidean Ramsey theoryFrankl-Rödl theorem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (13)

A recursive Lovász theta number for simplex-avoiding sets ⋮ The chromatic number of Rn$\mathbb {R}^{n}$ with multiple forbidden distances ⋮ 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 ⋮ Exponentially Ramsey sets ⋮ On the partition of an odd number into three primes in a prescribed proportion ⋮ Chromatic numbers of distance graphs without short odd cycles in rational spaces ⋮ 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 ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences ⋮ 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
• The chromatic number of space with forbidden regular simplex
• 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
• On the number of edges of a uniform hypergraph with a range of allowed intersections
• 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
• On the number of edges in a uniform hypergraph with a range of permitted intersections
• Around Borsuk's hypothesis
• The Difference Between Consecutive Primes, II
• Borsuk's problem and the chromatic numbers of some metric spaces
• Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection
• Coloring Distance Graphs and Graphs of Diameters
• Research Problems in Discrete Geometry
• A Partition Property of Simplices in Euclidean Space
• The Mathematical Coloring Book
• All Triangles are Ramsey
• Forbidden Intersections
• Permutation Groups in Euclidean Ramsey Theory
• On the chromatic number of a space
• On the chromatic number of an infinitesimal plane layer
• 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
• On the chromatic numbers of small-dimensional Euclidean spaces

This page was built for publication: On the Frankl–Rödl theorem