Weak regularity and finitely forcible graph limits
From MaRDI portal
Weak regularity and finitely forcible graph limits (scientific article; zbMATH DE number 6853960)
Recommendations
- Weak regularity and finitely forcible graph limits
- Finitely forcible graph limits are universal
- Compactness and finite forcibility of graphons
- Hypergraph limits: A regularity approach
- On limits of finite graphs
- Extremal graph theory and finite forcibility
- Finitely forcible graphons
- Finitely forcible graphons with an almost arbitrary structure
- scientific article; zbMATH DE number 1330009
- Regularity lemmas for graphs
Cites work
- A new bound for the 2/3 conjecture
- A new lower bound based on Gromov's method of selecting heavily covered points
- A Solution to the 2/3 Conjecture
- Asymptotic structure of graphs with the minimum number of triangles
- Bounds for graph regularity and removal lemmas
- Compactness and finite forcibility of graphons
- Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
- Convergent sequences of dense graphs. II. Multiway cuts and statistical physics
- Densities in large permutations and parameter testing
- Finitely forcible graphons
- Flag algebras
- Generalized quasirandom graphs
- Graph limits and parameter testing
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- Hypergraphs do jump
- Large networks and graph limits
- Limits of dense graph sequences
- Limits of permutation sequences
- Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
- Moments of two-variable functions and the uniqueness of graph limits
- Non-three-colourable common graphs exist
- On 3-hypergraphs with forbidden 4-vertex configurations
- On limits of finite graphs
- On the maximum number of five-cycles in a triangle-free graph
- On the Minimal Density of Triangles in Graphs
- On the number of pentagons in triangle-free graphs
- On universality of graphs with uniformly distributed edges
- Poset limits and exchangeable random posets
- Quasi-random graphs
- Quasirandom permutations are characterized by 4-point densities
- Quick approximation to matrices and applications
- Sparse graphs: metrics and random models
- Testing permutation properties through subpermutations
- Testing properties of graphs and functions
- Threshold graph limits and random threshold graphs
- Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
Cited in
(12)- Finitely forcible graph limits are universal
- Cut distance identifying graphon parameters over weak* limits
- Compactness and finite forcibility of graphons
- On a question of Vera T. Sós about size forcing of graphons
- Regularity partitions and the topology of graphons
- Hypergraph limits: A regularity approach
- Weak regularity and finitely forcible graph limits
- Finitely forcible graphons with an almost arbitrary structure
- Infinite-dimensional finitely forcible graphon
- Quasirandom Latin squares
- Approximating fractionally isomorphic graphons
- A tower lower bound for the degree relaxation of the regularity lemma
This page was built for publication: Weak regularity and finitely forcible graph limits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4608759)
