Extremal problems in uniformly dense hypergraphs

DOI10.1016/J.EJC.2020.103117MaRDI QIDQ2189833zbMATH OpenOpenAlexFDO

Authors Christian Reiher

Publication date 16 June 2020

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1901.04027

zbMATH Keywords

Turán's extremal function

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42) Hypergraphs (05C65)

Abstract: For a $k$-uniform hypergraph $F$ let $extrmex(n,F)$ be the maximum number of edges of a $k$-uniform $n$-vertex hypergraph $H$ which contains no copy of $F$. Determining or estimating $extrmex(n,F)$ is a classical and central problem in extremal combinatorics. While for graphs ($k=2$) this problem is well understood, due to the work of Mantel, Tur'an, ErdH{o}s, Stone, Simonovits and many others, only very little is known for $k$-uniform hypergraphs for $k>2$. Already the case when $F$ is a $k$-uniform hypergraph with three edges on $k+1$ vertices is still wide open even for $k=3$. We consider variants of such problems where the large hypergraph $H$ enjoys additional hereditary density conditions. Questions of this type were suggested by ErdH{o}s and S'os about 30 years ago. In recent work with R"odl and Schacht it turned out that the regularity method for hypergraphs, established by Gowers and by R"odl et al. about a decade ago, is a suitable tool for extremal problems of this type and we shall discuss some of those recent results and some interesting open problems in this area.

Recommendations

• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• On Ramsey - Turan type theorems for hypergraphs
• scientific article; zbMATH DE number 5942358
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Applications of the regularity lemma for uniform hypergraphs

Cites work

• An exact result for 3-graphs
• Edge-colored complete graphs with precisely colored subgraphs
• Embedding tetrahedra into quasirandom hypergraphs
• Extremal problems on set systems
• Flag algebras
• scientific article; zbMATH DE number 5942358 (Why is no real title available?)
• scientific article; zbMATH DE number 4196000 (Why is no real title available?)
• scientific article; zbMATH DE number 3224335 (Why is no real title available?)
• scientific article; zbMATH DE number 3262986 (Why is no real title available?)
• scientific article; zbMATH DE number 3285073 (Why is no real title available?)
• Hypergraph regularity and quasi-randomness
• Hypergraphs do jump
• Hypergraphs with vanishing Turán density in uniformly dense hypergraphs
• Hypergraphs, quasi-randomness, and conditions for regularity
• On 3-hypergraphs with forbidden 4-vertex configurations
• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• On Ramsey - Turan type theorems for hypergraphs
• On the structure of linear graphs
• On universality of graphs with uniformly distributed edges
• Paul turán, 1910–1976: His work in graph theory
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• Regular Partitions of Hypergraphs: Counting Lemmas
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Some remarks on _
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The Turán number of the Fano plane
• Triple Systems Not Containing a Fano Configuration
• Turán's theorem for the Fano plane

Cited in

(22)

• Extremal hypergraphs and bounds for the Turán density of the 4-uniform \(K_{5}\)
• On a Turán problem in weakly quasirandom 3-uniform hypergraphs
• The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture
• Daisies and other Turán problems
• Complete partite subgraphs in dense hypergraphs
• scientific article; zbMATH DE number 5130822 (Why is no real title available?)
• On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges
• Extremal problems involving neighborhood unions
• Some remarks on _
• Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
• Uniform Turán density of cycles
• FF‐factors in Quasi‐random Hypergraphs
• Restricted problems in extremal combinatorics
• Combination of bases and an evaluation of the set of extremal 3-uniform hypergraphs
• Hypergraphs with minimum positive uniform Turán density
• The codegree Turán density of 3-uniform tight cycles
• The minimum positive uniform Turán density in uniformly dense k-uniform hypergraphs
• Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
• Graph theory. Abstracts from the workshop held January 5--10, 2025
• Hypergraphs with arbitrarily small codegree Turán density
• Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures
• Weak hypergraph regularity and linear hypergraphs

This page was built for publication: Extremal problems in uniformly dense hypergraphs

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