Quasirandomness in hypergraphs
Summary: An \(n\)-vertex graph \(G\) of edge density \(p\) is considered to be \textit{quasirandom} if it shares several important properties with the random graph \(G(n,p)\). A well-known theorem of \textit{F. R. K. Chung} et al. [Combinatorica 9, No. 4, 345--362 (1989; Zbl 0715.05057)] states that many such `typical' properties are asymptotically equivalent and, thus, a graph \(G\) possessing one such property automatically satisfies the others. In recent years, work in this area has focused on uncovering more quasirandom graph properties and on extending the known resulty to other discrete structures. In the context of hypergraphs, however, one may consider several different notions of quasirandomness. A complete description of these notions has been provided recently by \textit{H. Towsner} [Random Struct. Algorithms 50, No. 1, 114--139 (2017; Zbl 1352.05168)], who proved several central equivalences using an analytic framework. We give short and purely combinatorial proofs of the main equivalences in Towsner's result [loc. cit.].
- Quasirandomness in hypergraphs
- Quasi-random hypergraphs
- Quasi-random hypergraphs
- Quasi-random hypergraphs revisited
- Quasi-randomness and the regularity method in hypergraphs
- Hypergraph regularity and quasi-randomness
- Quasi‐random classes of hypergraphs
- Quasirandomness in Graphs
- Hypergraphs, quasi-randomness, and conditions for regularity
- σ-algebras for quasirandom hypergraphs
- Bipartite subgraphs and quasi-randomness
- Eigenvalues and expanders
- Eigenvalues and linear quasirandom hypergraphs
- Eigenvalues of non-regular linear quasirandom hypergraphs
- Explicit construction of linear sized tolerant networks
- Finite reflection groups and graph norms
- Forcing quasirandomness with triangles
- Generalized quasirandom graphs
- Hereditary Extended Properties, Quasi-Random Graphs and Induced Subgraphs
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 2086426 (Why is no real title available?)
- Hypergraph regularity and quasi-randomness
- Hypergraphs, quasi-randomness, and conditions for regularity
- On universality of graphs with uniformly distributed edges
- Pseudo-random graphs
- Pseudo-random hypergraphs
- Pseudorandomness
- Quasi-random graphs
- Quasi-random graphs and graph limits
- Quasi-random hypergraphs
- Quasi-Random Set Systems
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Quasi-random tournaments
- Quasi-randomness and the distribution of copies of a fixed graph
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- Quasi-randomness of graph balanced cut properties
- Quasirandom Groups
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Quasi‐random classes of hypergraphs
- Regularity lemmas for hypergraphs and quasi-randomness
- Szemerédi's partition and quasirandomness
- The number of submatrices of a given type in a Hadamard matrix and related results
- The poset of hypergraph quasirandomness
- The uniformity lemma for hypergraphs
- Weak hypergraph regularity and linear hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- Quasi-randomness and the distribution of copies of a fixed graph
- Hypergraphs, quasi-randomness, and conditions for regularity
- Hamiltonicity in cherry-quasirandom 3-graphs
- Tiling multipartite hypergraphs in quasi-random hypergraphs
- σ-algebras for quasirandom hypergraphs
- Quasi-random hypergraphs revisited
- The quasi-randomness of hypergraph cut properties
- Embedding tetrahedra into quasirandom hypergraphs
- Generating Random Hyperbolic Graphs in Subquadratic Time
- Quasi-randomness Is Determined by the Distribution of Copies of a Fixed Graph in Equicardinal Large Sets
- Note on upper density of quasi-random hypergraphs
- Forcing quasirandomness with triangles
- Tight Hamilton cycles in cherry-quasirandom 3-uniform hypergraphs
- Localized codegree conditions for tight Hamilton cycles in 3-uniform hypergraphs
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Quasi-random words and limits of word sequences
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Quasirandomness in hypergraphs
- Concentration estimates for functions of finite high‐dimensional random arrays
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Natural quasirandomness properties
- FF‐factors in Quasi‐random Hypergraphs
- Dirac-type conditions for spanning bounded-degree hypertrees
- Localised codegree conditions for tight Hamiltonian cycles in 3-uniform hypergraphs
- Transversals via regularity
- Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
- Turán density of cliques of order five in 3-uniform hypergraphs with quasirandom links
- Weak randomness in graphons and theons
This page was built for publication: Quasirandomness in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915722)
