On the maximal number of edges in a uniform hypergraph with one forbidden intersection
From MaRDI portal
Publication:892713
DOI10.1134/S106456241504002XzbMath1345.05068OpenAlexW2217199928MaRDI QIDQ892713
A. V. Bobu, A. E. Kupriyanov, Andrei M. Raigorodskii
Publication date: 12 November 2015
Published in: Doklady Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s106456241504002x
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (10)
On chromatic numbers of close-to-Kneser distance graphs ⋮ On a bound in extremal combinatorics ⋮ On chromatic numbers of nearly Kneser distance graphs ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ Chromatic numbers of some distance graphs ⋮ Estimate of the number of edges in special subgraphs of a distance graph ⋮ On the chromatic numbers corresponding to exponentially Ramsey sets ⋮ On the Frankl–Rödl theorem ⋮ Exponentially Ramsey sets ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences
Cites Work
- 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 complete intersection theorem for systems of finite sets
- On a packing and covering problem
- Intersection theorems with geometric consequences
- Codes with forbidden distances
- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- Excursions into combinatorial geometry
- Borsuk's problem and the chromatic numbers of some metric spaces
- Thirty Essays on Geometric Graph Theory
- The Mathematical Coloring Book
This page was built for publication: On the maximal number of edges in a uniform hypergraph with one forbidden intersection