A hypergraph regularity method for generalized Turán problems

DOI10.1002/rsa.20249zbMath1182.05125arXiv0809.3674OpenAlexW4256532737MaRDI QIDQ3608316

Peter Keevash

Publication date: 4 March 2009

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphsextremal combinatoricsFano planequasirandom hypergraphshypergraph regularityquasirandom counting lemma

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Combinatorial structures in finite projective spaces (51E20) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

Counting Steiner triple systems, Codegree Turán Density of Complete $r$-Uniform Hypergraphs, The Codegree Threshold for 3-Graphs with Independent Neighborhoods, On the codegree density of complete 3-graphs and related problems, The codegree threshold of \(K_4^-\), On the Chromatic Thresholds of Hypergraphs, On the co-degree threshold for the Fano plane, Hypergraphs with independent neighborhoods, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A hypergraph blow-up lemma, Codegree Thresholds for Covering 3-Uniform Hypergraphs, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, On the Codegree Density of $PG_m(q)$, The poset of hypergraph quasirandomness

Cites Work

• Set systems without a simplex or a cluster
• A variant of the hypergraph removal lemma
• Limits of dense graph sequences
• The maximum size of 3-uniform hypergraphs not containing a Fano plane
• On a hypergraph Turán problem of Frankl
• Codegree problems for projective geometries
• The primes contain arbitrarily long arithmetic progressions
• Hypergraph regularity and the multidimensional Szemerédi theorem
• The Turán problem for projective geometries
• The co-degree density of the Fano plane
• Co-degree density of hypergraphs
• Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Regularity Lemma for k-uniform hypergraphs
• Regular Partitions of Hypergraphs: Regularity Lemmas
• Triple Systems Not Containing a Fano Configuration
• Quasi-random graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item