Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection

DOI10.1070/SM8473zbMath1345.05024OpenAlexW2313564267MaRDI QIDQ2821890

A. E. Kupriyanov, A. V. Bobu, Andrei M. Raigorodskii

Publication date: 26 September 2016

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

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

zbMATH Keywords

Nelson-Hadwiger problemFrankl-Wilson theoremconstant-weight error-correcting codeshypergraphs with one forbidden intersection of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Other types of codes (94B60) Coloring of graphs and hypergraphs (05C15)

Related Items (14)

On chromatic numbers of close-to-Kneser distance graphs ⋮ On the number of edges in a uniform hypergraph with a range of permitted intersections ⋮ On the number of edges of a uniform hypergraph with a range of allowed intersections ⋮ On a Frankl-Wilson theorem ⋮ Chromatic numbers of some distance graphs ⋮ 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 ⋮ On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) ⋮ The number of edges in induced subgraphs of some distance graphs ⋮ Improved Frankl-Rödl theorem and some of its geometric consequences

This page was built for publication: Asymptotic study of the maximum number of edges in a uniform hypergraph with one forbidden intersection