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

DOI10.1134/S0081543815010071zbMath1319.05095MaRDI QIDQ492207

A. E. Zvonarev, Andrei M. Raigorodskii

Publication date: 20 August 2015

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

upper boundhypergraphsproduct of cardinalities of edge sets

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (10)

On chromatic numbers of close-to-Kneser distance graphs ⋮ Lower bounds for the chromatic numbers of distance graphs with large girth ⋮ On a bound in extremal combinatorics ⋮ Upper bounds for the chromatic numbers of Euclidean spaces with forbidden Ramsey sets ⋮ Improvements of the Frankl-Rödl theorem and geometric consequences ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On a Frankl-Rödl theorem and its geometric corollaries ⋮ The chromatic number of space with forbidden regular simplex ⋮ Exponentially Ramsey sets ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
• New bounds for the chromatic number of a space with forbidden isosceles triangles
• Improvement of the Frankl-Rödl theorem on the number of edges in hypergraphs with forbidden cardinalities of edge intersections
• The complete intersection theorem for systems of finite sets
• Lectures on advances in combinatorics
• Intersection theorems with geometric consequences
• The complete nontrivial-intersection theorem for systems of finite sets
• Chromatic numbers of spaces with forbidden monochromatic triangles
• New estimates in the problem of the number of edges in a hypergraph with forbidden 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
• New lower bounds for the chromatic number of a space with forbidden isosceles triangles
• The Erdős-Hadwiger problem and the chromatic numbers of finite geometric graphs
• The maximum sum and the maximum product of sizes of cross-intersecting families
• The Difference Between Consecutive Primes, II
• Borsuk's problem and the chromatic numbers of some metric spaces
• 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
• On the chromatic number of a space
• On the chromatic number of a space with forbidden equilateral triangle

This page was built for publication: 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