Regularity lemmas for hypergraphs and quasi-randomness

DOI10.1002/rsa.3240020208zbMath0756.05081WikidataQ124807484 ScholiaQ124807484MaRDI QIDQ3978309

Fan R. K. Chung

Publication date: 25 June 1992

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

Full work available at URL: https://doi.org/10.1002/rsa.3240020208

zbMATH Keywords

hypergraphs; quasi-randomness; regularity lemmas; \(k\)-uniform hypergraphs

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

05C65: Hypergraphs

Related Items

Counting subgraphs in quasi‐random 4‐uniform hypergraphs, Quasi-Random Set Systems, Regularity Lemma for k-uniform hypergraphs, Rainbow Erdös--Rothschild Problem for the Fano Plane, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, Quasirandomness in hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, Uniform hypergraphs with many edge‐colorings avoiding a fixed rainbow expanded complete graph, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, F$F$‐factors in Quasi‐random Hypergraphs, Polynomial-time perfect matchings in dense hypergraphs, Tight cycles and regular slices in dense hypergraphs, On the Hamiltonicity of triple systems with high minimum degree, The Ramsey number for hypergraph cycles. I., A variant of the hypergraph removal lemma, Weak hypergraph regularity and linear hypergraphs, Dirac-type results for loose Hamilton cycles in uniform hypergraphs, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, A Tverberg-type result on multicolored simplices, Regularity lemmas for clustering graphs, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Fractional and integer matchings in uniform hypergraphs, Tiling multipartite hypergraphs in quasi-random hypergraphs, The 3-Colour Ramsey Number of a 3-Uniform Berge Cycle, Weak quasi-randomness for uniform hypergraphs, On replica symmetry of large deviations in random graphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, A Folkman Linear Family, Excluding Induced Subgraphs III: A General Asymptotic

Cites Work

• Unnamed Item
• Unnamed Item
• Extremal problems in discrete geometry
• Quasi‐random classes of hypergraphs
• Quasi-random graphs