The quasi-randomness of hypergraph cut properties
From MaRDI portal
Publication:3119045
DOI10.1002/rsa.20364zbMath1241.05105arXiv1002.0149OpenAlexW2102347084MaRDI QIDQ3119045
Publication date: 7 March 2012
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.0149
Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Association schemes, strongly regular graphs (05E30)
Related Items (7)
Quasi-randomness of graph balanced cut properties ⋮ σ-algebras for quasirandom hypergraphs ⋮ Rational decomposition of dense hypergraphs and some related eigenvalue estimates ⋮ Perfect Packings in Quasirandom Hypergraphs II ⋮ FORCING QUASIRANDOMNESS WITH TRIANGLES ⋮ More on quasi-random graphs, subgraph counts and graph limits ⋮ Quasi-Random Oriented Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- A variant of the hypergraph removal lemma
- Szemerédi's lemma for the analyst
- Weak hypergraph regularity and linear hypergraphs
- Quasi-randomness and the distribution of copies of a fixed graph
- Quick approximation to matrices and applications
- Hereditarily extended properties, quasi-random graphs and not necessarily induced subgraphs
- Generalized quasirandom graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hereditary quasi-random properties of hypergraphs
- The effect of induced subgraphs on quasi-randomness
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random tournaments
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi-random hypergraphs
- Quasirandom Groups
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- Extremal problems on set systems
- Quasi-Random Set Systems
- Regularity Lemma for k-uniform hypergraphs
- The counting lemma for regular k‐uniform hypergraphs
- A Certain Class of Incidence Matrices
- Quasi-random graphs
This page was built for publication: The quasi-randomness of hypergraph cut properties