Hypergraphs, quasi-randomness, and conditions for regularity
From MaRDI portal
Publication:1604564
DOI10.1006/jcta.2001.3217zbMath0990.05111OpenAlexW2059456505MaRDI QIDQ1604564
Jozef Skokan, Vojtěch Rödl, Yoshiharu Kohayakawa
Publication date: 4 July 2002
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1a1d2819fd8dcbb7d46459db48b1ef8b18f9f274
Related Items
Lower bound on the size of a quasirandom forcing set of permutations, Quasirandom permutations are characterized by 4-point densities, Quasi-random multilinear polynomials, Embedding tetrahedra into quasirandom hypergraphs, A variant of the hypergraph removal lemma, Integer and fractional packings of hypergraphs, On vertex independence number of uniform hypergraphs, Covering 3‐uniform hypergraphs by vertex‐disjoint tight paths, Concentration estimates for functions of finite high‐dimensional random arrays, Quasirandom-Forcing Orientations of Cycles, Extremal problems in uniformly dense hypergraphs, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Hypergraph regularity and random sampling, Natural quasirandomness properties, Quasirandom Latin squares, Minimum degree conditions for tight Hamilton cycles, F$F$‐factors in Quasi‐random Hypergraphs, Spectra of uniform hypergraphs, Restricted problems in extremal combinatorics, Tiling multipartite hypergraphs in quasi-random hypergraphs, Perfect Packings in Quasirandom Hypergraphs II, Hypergraphs with vanishing Turán density in uniformly dense hypergraphs, The hypergraph regularity method and its applications, FORCING QUASIRANDOMNESS WITH TRIANGLES, On pseudo-random subsets of the set of the integers not exceeding \(N\), Note on the 3-graph counting Lemma, An analytic approach to sparse hypergraphs: hypergraph removal, Tight cycles and regular slices in dense hypergraphs, The Gaussian primes contain arbitrarily shaped constellations, Erdős-Hajnal-type theorems in hypergraphs, Hamilton \(\ell \)-cycles in uniform hypergraphs, Embedding and Ramsey numbers of sparse \(k\)-uniform hypergraphs, Quasirandomness in hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, On random sampling in uniform hypergraphs, Characterization of quasirandom permutations by a pattern sum, A hypergraph blow-up lemma, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, Weak quasi-randomness for uniform hypergraphs, Quasi-random hypergraphs revisited, No additional tournaments are quasirandom-forcing, The poset of hypergraph quasirandomness
Cites Work
- Unnamed Item
- On testing the `pseudo-randomness' of a hypergraph
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Pseudo-random hypergraphs
- Cyclotomy and difference families in elementary Abelian groups
- Quasi-random hypergraphs
- Quasi‐random classes of hypergraphs
- The Algorithmic Aspects of the Regularity Lemma
- Quasi-Random Set Systems
- On characterizing hypergraph regularity
- Communication Complexity and Quasi Randomness
