Quasi-random hypergraphs
From MaRDI portal
Publication:3490029
DOI10.1002/rsa.3240010108zbMath0708.05044MaRDI QIDQ3490029
Ronald L. Graham, Fan R. K. Chung
Publication date: 1990
Published in: Random Structures and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240010108
Related Items
FORCING QUASIRANDOMNESS WITH TRIANGLES, An analytic approach to sparse hypergraphs: hypergraph removal, On characterizing hypergraph regularity, Quasi-Random Set Systems, The poset of hypergraph quasirandomness, A Note on Even Cycles and Quasirandom Tournaments, Perfect Packings in Quasirandom Hypergraphs II, The hypergraph regularity method and its applications, EIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHS, Quasi-random graphs, Quasirandomness in hypergraphs, Linear quasi-randomness of subsets of abelian groups and hypergraphs, Lower bound on the size of a quasirandom forcing set of permutations, Concentration estimates for functions of finite high‐dimensional random arrays, Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs, Natural quasirandomness properties, Quasirandom Latin squares, F$F$‐factors in Quasi‐random Hypergraphs, Inverse expander mixing for hypergraphs, Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets, Laplace eigenvalues of graphs---a survey, On hypergraphs having evenly distributed subhypergraphs, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma, Quasi-randomness and the distribution of copies of a fixed graph, Quasi-random subsets of \(\mathbb{Z}_ n\), On testing the `pseudo-randomness' of a hypergraph, Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs, Hypergraphs, quasi-randomness, and conditions for regularity, On the maximum density of fixed strongly connected subtournaments, Regularity lemmas for clustering graphs, No additional tournaments are quasirandom-forcing, Quasirandom permutations are characterized by 4-point densities, Tournaments, 4-uniform hypergraphs, and an exact extremal result, On pseudo-random subsets of the set of the integers not exceeding \(N\), Quasirandom arithmetic permutations, Quasi-random multilinear polynomials, Tiling multipartite hypergraphs in quasi-random hypergraphs, Random walks on simplicial complexes and harmonics, Quasi-randomness of graph balanced cut properties, σ-algebras for quasirandom hypergraphs, Weak quasi-randomness for uniform hypergraphs, The quasi-randomness of hypergraph cut properties, Characterization of quasirandom permutations by a pattern sum, Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets, Cohomological Aspects of Hypergraphs
Cites Work
