The uniformity lemma for hypergraphs
From MaRDI portal
Publication:1205340
DOI10.1007/BF02351586zbMath0777.05084OpenAlexW2027974205WikidataQ124843215 ScholiaQ124843215MaRDI QIDQ1205340
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
Related Items
On characterizing hypergraph regularity, A Folkman Linear Family, Extremal problems on set systems, Regularity Lemma for k-uniform hypergraphs, Counting in hypergraphs via regularity inheritance, A variant of the hypergraph removal lemma, The Erdős matching conjecture and concentration inequalities, A Tverberg-type result on multicolored simplices, On vertex independence number of uniform hypergraphs, Hypergraph regularity and random sampling, Some Cubic Time Regularity Algorithms for Triple Systems, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On Colourings of Hypergraphs Without Monochromatic Fano Planes, Constructive Packings by Linear Hypergraphs, On the Hamiltonicity of triple systems with high minimum degree, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Weak hypergraph regularity and linear hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Counting subgraphs in quasi‐random 4‐uniform hypergraphs, Quasirandomness in hypergraphs, Partitioning problems in dense hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Rainbow Erdös--Rothschild Problem for the Fano Plane, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, Weak quasi-randomness for uniform hypergraphs, The Ramsey number for hypergraph cycles. I.
Cites Work
