Forcing generalized quasirandom graphs efficiently (extended abstract)
From MaRDI portal
Cites work
- Characterization of quasirandom permutations by a pattern sum
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- Finitely forcible graph limits are universal
- Finitely forcible graphons and permutons
- Generalized quasirandom graphs
- Graph limits and exchangeable random graphs
- 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 3722700 (Why is no real title available?)
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Hypergraphs, quasi-randomness, and conditions for regularity
- Large networks and graph limits
- Limits of dense graph sequences
- Lower bound on the size of a quasirandom forcing set of permutations
- Moments of two-variable functions and the uniqueness of graph limits
- No additional tournaments are quasirandom-forcing
- On the density of transitive tournaments
- On the maximum density of fixed strongly connected subtournaments
- On universality of graphs with uniformly distributed edges
- Optimal graphon estimation in cut distance
- Oracle inequalities for network models and sparse graphon estimation
- Pseudo-random hypergraphs
- Quasi-random graphs
- Quasi-random hypergraphs
- Quasi-Random Set Systems
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Quasi-random tournaments
- Quasirandom Groups
- Quasirandom Latin squares
- Quasirandom multitype graphs
- Quasirandom permutations
- Quasirandom permutations are characterized by 4-point densities
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Rate-optimal graphon estimation
- Regularity Lemma for k-uniform hypergraphs
- Szemerédi's partition and quasirandomness
- The counting lemma for regular k‐uniform hypergraphs
- Tournament quasirandomness from local counting
This page was built for publication: Forcing generalized quasirandom graphs efficiently (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6997056)
