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

DOI10.1070/SM8473MaRDI QIDQ2821890zbMATH OpenOpenAlexFDO

Authors Andrei V. Bobu, Aleksandr È. Kupriyanov, 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

constant-weight error-correcting codesFrankl-Wilson theoremhypergraphs with one forbidden intersection of edgesNelson-Hadwiger problem

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) 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)

Recommendations

• On the number of edges of a uniform hypergraph with a range of allowed intersections
• On the number of edges in a uniform hypergraph with a range of permitted intersections
• On the maximal number of edges in a uniform hypergraph with one forbidden intersection
• An improvement of the Frankl-Wilson theorem on the number of edges in a hypergraph with forbidden intersections of edges
• Sparse hypergraphs with applications to coding theory

Cited in

(20)

• On the chromatic numbers of some distance graphs
• 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
• 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
• 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 Frankl-Rödl theorem
• On a Frankl-Wilson theorem and its geometric corollaries
• Cutting corners
• Lower bounds for the independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\)
• Johnson graphs, their random subgraphs, and some of their extremal characteristics
• The asymptotic induced matching number of hypergraphs: balanced binary strings
• On the maximal number of edges in a uniform hypergraph with one forbidden intersection

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2821890)