Regularity lemmas for hypergraphs and quasi-randomness
From MaRDI portal
Publication:3978309
DOI10.1002/rsa.3240020208zbMath0756.05081WikidataQ124807484 ScholiaQ124807484MaRDI QIDQ3978309
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
Related Items
Counting subgraphs in quasi‐random 4‐uniform hypergraphs, Quasi-Random Set Systems, Regularity Lemma for k-uniform hypergraphs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, EIGENVALUES AND LINEAR QUASIRANDOM 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, Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs, Fractional and integer matchings in uniform 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, A Folkman Linear Family, Excluding Induced Subgraphs III: A General Asymptotic
Cites Work
