Quasi-random hypergraphs
From MaRDI portal
Recommendations
Cites work
Cited in
(67)- 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
- Pseudo-random hypergraphs
- 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
- Inverse expander mixing for hypergraphs
- Random walks on simplicial complexes and harmonics
- Hereditary quasi-random properties of hypergraphs
- Quasi-randomness of graph balanced cut properties
- σ-algebras for quasirandom hypergraphs
- Weak quasi-randomness for uniform hypergraphs
- Quasi-random hypergraphs revisited
- 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
- Random hypergraphs in pseudofinite fields
- Note on upper density of quasi-random hypergraphs
- Quasi‐random classes of hypergraphs
- Cohomological Aspects of Hypergraphs
- scientific article; zbMATH DE number 1512675 (Why is no real title available?)
- Forcing quasirandomness with triangles
- An analytic approach to sparse hypergraphs: hypergraph removal
- Quasi-Random Set Systems
- On characterizing hypergraph regularity
- Arithmetic progression hypergraphs: examining the second moment method
- Quasi-random hypergraphs
- The poset of hypergraph quasirandomness
- Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
- 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
- Lower bound on the size of a quasirandom forcing set of permutations
- Quasi-random graphs
- Quasi-random graphs
- Quasirandomness in hypergraphs
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Linear quasi-randomness of subsets of abelian groups and hypergraphs
- Quasirandomness in hypergraphs
- Concentration estimates for functions of finite high‐dimensional random arrays
- Quasirandom-Forcing Orientations of Cycles
- Factors and loose Hamilton cycles in sparse pseudo‐random hypergraphs
- Natural quasirandomness properties
- Quasirandom Latin squares
- FF‐factors in Quasi‐random Hypergraphs
- Hereditary quasirandom properties of hypergraphs
- Quasi-random Boolean functions
- A smoother notion of spread hypergraphs
- Forcing generalised quasirandom graphs efficiently
- Laplace eigenvalues of graphs---a survey
- On hypergraphs having evenly distributed subhypergraphs
- Non-linear Hamilton cycles in linear quasirandom and uniformly dense hypergraphs
- Forcing generalized quasirandom graphs efficiently (extended abstract)
- Weak randomness in graphons and theons
- f-Diophantine sets over finite fields via quasi-random hypergraphs from multivariate polynomials
- Forcing quasirandomness in a regular tournament
- A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal Lemma
This page was built for publication: Quasi-random hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3490029)
