On a bound in extremal combinatorics

DOI10.1134/S1064562418010155zbMath1390.05151OpenAlexW2792490967MaRDI QIDQ1643771

A. A. Sagdeev, Andrei M. Raigorodskii

Publication date: 20 June 2018

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

Full work available at URL: https://doi.org/10.1134/s1064562418010155

zbMATH Keywords

maximum number of edges in a hypergraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Ramsey theory (05D10)

Related Items (12)

On a Frankl-Wilson theorem ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ A generalization of Kneser graphs ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On the chromatic numbers of some distance graphs ⋮ On the Frankl–Rödl theorem ⋮ Exponentially Ramsey sets ⋮ Bounds on Borsuk numbers in distance graphs of a special type ⋮ Equitable colorings of hypergraphs with few edges ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences

Cites Work

• On random subgraphs of Kneser and Schrijver graphs
• 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 the maximal number of edges in a uniform hypergraph with one forbidden intersection
• On lower bounds for the chromatic number of sphere
• Intersection theorems with geometric consequences
• New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
• New lower bound for the chromatic number of a rational space with one and two forbidden distances
• On the chromatic numbers of low-dimensional spaces
• Improvements of the Frankl-Rödl theorem and geometric consequences
• On the chromatic number of a space
• The realization of distances within sets in Euclidean space

This page was built for publication: On a bound in extremal combinatorics