Regularity lemmas for hypergraphs and quasi-randomness
From MaRDI portal
Publication:3978309
DOI10.1002/rsa.3240020208zbMath0756.05081OpenAlexW2105457218WikidataQ124807484 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
A Folkman Linear Family, Quasi-Random Set Systems, Fractional and integer matchings in uniform hypergraphs, Regularity Lemma for k-uniform hypergraphs, Excluding Induced Subgraphs III: A General Asymptotic, A variant of the hypergraph removal lemma, On replica symmetry of large deviations in random graphs, A Tverberg-type result on multicolored simplices, 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, Some Cubic Time Regularity Algorithms for Triple Systems, Tiling multipartite hypergraphs in quasi-random hypergraphs, Loose Hamiltonian Cycles Forced by Large $(k-2)$-Degree---Approximate Version, Polynomial-time perfect matchings in dense hypergraphs, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, Tight cycles and regular slices in dense 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, Regularity lemmas for clustering graphs, Quasirandomness in 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, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, Weak quasi-randomness for uniform hypergraphs, The Ramsey number for hypergraph cycles. I.
Cites Work
