Forcing generalised quasirandom graphs efficiently
From MaRDI portal
Publication:6632790
DOI10.1017/s0963548323000263MaRDI QIDQ6632790
Andrzej Grzesik, Oleg Pikhurko, Daniel Král'
Publication date: 5 November 2024
Published in: (Search for Journal in Brave)
Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rate-optimal graphon estimation
- Finitely forcible graphons and permutons
- Oracle inequalities for network models and sparse graphon estimation
- Limits of dense graph sequences
- On universality of graphs with uniformly distributed edges
- Hypergraphs, quasi-randomness, and conditions for regularity
- Finitely forcible graph limits are universal
- On the maximum density of fixed strongly connected subtournaments
- Pseudo-random hypergraphs
- Quasirandom permutations
- Tournament quasirandomness from local counting
- Consistent nonparametric estimation for heavy-tailed sparse graphs
- No additional tournaments are quasirandom-forcing
- Partial associativity and rough approximate groups
- Finitely forcible graphons
- Optimal graphon estimation in cut distance
- Quasirandom permutations are characterized by 4-point densities
- Moments of two-variable functions and the uniqueness of graph limits
- Generalized quasirandom graphs
- Hypergraph regularity and the multidimensional Szemerédi theorem
- Quasi-random tournaments
- Quasirandomness, Counting and Regularity for 3-Uniform Hypergraphs
- Characterization of quasirandom permutations by a pattern sum
- Elusive extremal graphs
- Quasi-random hypergraphs
- Quasirandom Groups
- Graph limits and exchangeable random graphs
- Szemerédi's partition and quasirandomness
- Quasi-Random Set Systems
- Finitely forcible graphons with an almost arbitrary structure
- On the Density of Transitive Tournaments
- Lower bound on the size of a quasirandom forcing set of permutations
- Quasi-random graphs
- Transversals in quasirandom latin squares
- Quasirandom-Forcing Orientations of Cycles
- Natural quasirandomness properties
- Quasirandom Latin squares
This page was built for publication: Forcing generalised quasirandom graphs efficiently
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632790)
