Quasi‐random classes of hypergraphs

DOI10.1002/RSA.3240010401MaRDI QIDQ3970905zbMATH OpenOpenAlexFDO

Authors Fan Chung

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.3240010401

zbMATH Keywords

\(k\)-uniform-hypergraphsquasi-random classes

Mathematics Subject Classification ID

Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Quasi-random hypergraphs
• Quasi-random hypergraphs
• Quasi-random hypergraphs revisited
• Quasi-random graphs
• Communication Complexity and Quasi Randomness

Cites work

• A Constructive Solution to a Tournament Problem
• Expanders, randomness, or time versus space
• The number of submatrices of a given type in a Hadamard matrix and related results

Cited in

(37)

• Quasi-random subsets of \(\mathbb{Z}_ n\)
• Quasi-ultrametrics and their \(2\)-ball hypergraphs
• Hypergraphs, quasi-randomness, and conditions for regularity
• The mother of all leakages: how to simulate noisy leakages via bounded leakage (almost) for free
• Leakage-resilient key exchange and two-seed extractors
• On pseudo-random subsets of the set of the integers not exceeding \(N\)
• Quasi-random multilinear polynomials
• Tiling multipartite hypergraphs in quasi-random hypergraphs
• Quasi-random oriented graphs
• σ-algebras for quasirandom hypergraphs
• Weak quasi-randomness for uniform hypergraphs
• Quasi-random hypergraphs revisited
• Embedding Graphs into Larger Graphs: Results, Methods, and Problems
• Quasi-random hypergraphs
• Quantum multiparty communication complexity and circuit lower bounds
• Hadamard tensors and lower bounds on multiparty communication complexity
• Regularity lemmas for hypergraphs and quasi-randomness
• Forcing quasirandomness with triangles
• Quasi-Random Set Systems
• Hypergraph expanders of all uniformities from Cayley graphs
• Quasi-random hypergraphs
• The poset of hypergraph quasirandomness
• Communication Complexity and Quasi Randomness
• Perfect Packings in Quasirandom Hypergraphs II
• The hypergraph regularity method and its applications
• Regularity, uniformity, and quasirandomness
• Eigenvalues and linear quasirandom hypergraphs
• Quasirandomness in hypergraphs
• Linear quasi-randomness of subsets of abelian groups and hypergraphs
• Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
• Natural quasirandomness properties
• FF‐factors in Quasi‐random Hypergraphs
• Quasi-random Boolean functions
• Laplace eigenvalues of graphs---a survey
• Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
• Weak randomness in graphons and theons
• f-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials

This page was built for publication: Quasi‐random classes of hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970905)