The uniformity lemma for hypergraphs

DOI10.1007/BF02351586MaRDI QIDQ1205340zbMATH OpenOpenAlexWikidataFDO

Authors Vojtěch Rödl, Peter Frankl

Publication date 1 April 1993

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02351586

zbMATH Keywords

hypergraphsuniformity lemmaSzemerédi's theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Recommendations

• Regularity Lemma for k-uniform hypergraphs
• The counting lemma for regular k‐uniform hypergraphs
• Regularity lemmas for hypergraphs and quasi-randomness
• Applications of the regularity lemma for uniform hypergraphs
• On Ramsey - Turan type theorems for hypergraphs

Cites work

• Exact solution of some Turán-type problems
• The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent

Cited in

(37)

• Constructive packings by linear hypergraphs
• Hypergraph regularity and random sampling
• The Ramsey number for hypergraph cycles. I.
• Embedding loose spanning trees in 3-uniform hypergraphs
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Quasirandomness in hypergraphs
• Quasi-random Boolean functions
• The Erdős matching conjecture and concentration inequalities
• Partitioning problems in dense hypergraphs
• On vertex independence number of uniform hypergraphs
• A Folkman linear family
• On the irregularity of uniform hypergraphs
• Weak hypergraph regularity and linear hypergraphs
• On the irregularity of uniform hypergraphs
• A Tverberg-type result on multicolored simplices
• On a generalisation of Mantel’s Theorem to Uniformly Dense Hypergraphs
• Dirac-type results for loose Hamilton cycles in uniform hypergraphs
• Uniform edge distribution in hypergraphs is hereditary
• Extremal problems on set systems
• A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
• On colourings of hypergraphs without monochromatic Fano planes
• On characterizing hypergraph regularity
• Rainbow Erdös-Rothschild problem for the Fano plane
• An Erdős-Gallai type theorem for uniform hypergraphs
• Eigenvalues and linear quasirandom hypergraphs
• Counting in hypergraphs via regularity inheritance
• Some Cubic Time Regularity Algorithms for Triple Systems
• Linear quasi-randomness of subsets of abelian groups and hypergraphs
• A variant of the hypergraph removal lemma
• Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
• Counting subgraphs in quasi‐random 4‐uniform hypergraphs
• A pair degree condition for Hamiltonian cycles in 3-uniform hypergraphs
• The 3-colour Ramsey number of a 3-uniform Berge cycle
• Weak quasi-randomness for uniform hypergraphs
• On the Hamiltonicity of triple systems with high minimum degree
• Loose Hamiltonian cycles forced by large \((k-2)\)-degree-approximate version
• Regularity Lemma for k-uniform hypergraphs

This page was built for publication: The uniformity lemma for hypergraphs

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