Quasi-random hypergraphs

From MaRDI portal
Revision as of 23:16, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3490029

DOI10.1002/rsa.3240010108zbMath0708.05044OpenAlexW2079810243MaRDI 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 (46)

Lower bound on the size of a quasirandom forcing set of permutationsInverse expander mixing for hypergraphsOn characterizing hypergraph regularityQuasi-Random Set SystemsQuasirandom permutations are characterized by 4-point densitiesQuasi-random multilinear polynomialsQuasi-randomness of graph balanced cut propertiesTournaments, 4-uniform hypergraphs, and an exact extremal resultA Note on Even Cycles and Quasirandom Tournamentsσ-algebras for quasirandom hypergraphsConcentration estimates for functions of finite high‐dimensional random arraysQuasirandom-Forcing Orientations of CyclesFactors and loose Hamilton cycles in sparse pseudo‐random hypergraphsNatural quasirandomness propertiesQuasirandom Latin squaresF$F$‐factors in Quasi‐random HypergraphsTiling multipartite hypergraphs in quasi-random hypergraphsPerfect Packings in Quasirandom Hypergraphs IIA correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal LemmaThe hypergraph regularity method and its applicationsQuasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large SetsFORCING QUASIRANDOMNESS WITH TRIANGLESOn the maximum density of fixed strongly connected subtournamentsQuasi-random graphsOn pseudo-random subsets of the set of the integers not exceeding \(N\)An analytic approach to sparse hypergraphs: hypergraph removalQuasi-random subsets of \(\mathbb{Z}_ n\)On testing the `pseudo-randomness' of a hypergraphLaplace eigenvalues of graphs---a surveyOn hypergraphs having evenly distributed subhypergraphsQuasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large setsRegularity lemmas for clustering graphsQuasirandomness in hypergraphsLinear quasi-randomness of subsets of abelian groups and hypergraphsCohomological Aspects of HypergraphsCharacterization of quasirandom permutations by a pattern sumRandom walks on simplicial complexes and harmonicsHereditarily extended properties, quasi-random graphs and not necessarily induced subgraphsEIGENVALUES AND LINEAR QUASIRANDOM HYPERGRAPHSQuasirandom arithmetic permutationsQuasi-randomness and the distribution of copies of a fixed graphWeak quasi-randomness for uniform hypergraphsThe quasi-randomness of hypergraph cut propertiesNo additional tournaments are quasirandom-forcingThe poset of hypergraph quasirandomnessHypergraphs, quasi-randomness, and conditions for regularity



Cites Work


This page was built for publication: Quasi-random hypergraphs