Extremal graph theory and finite forcibility
From MaRDI portal
(Redirected from Publication:1689971)
Recommendations
- scientific article; zbMATH DE number 863492
- scientific article; zbMATH DE number 2123255
- scientific article; zbMATH DE number 3841900
- Extremal infinite graph theory
- On extremal graphs for zero forcing number
- scientific article; zbMATH DE number 3258067
- scientific article; zbMATH DE number 3191789
- scientific article; zbMATH DE number 3520446
- Finite Geometry and Extremal Graph Theory
- Finitely forcible graphons
Cites work
- scientific article; zbMATH DE number 4027516 (Why is no real title available?)
- scientific article; zbMATH DE number 4099367 (Why is no real title available?)
- Bounds for graph regularity and removal lemmas
- Compactness and finite forcibility of graphons
- Finitely forcible graph limits are universal
- Finitely forcible graphons
- Flag algebras
- Generalized quasirandom graphs
- Infinite-dimensional finitely forcible graphon
- Large networks and graph limits
- Limits of dense graph sequences
- Moments of two-variable functions and the uniqueness of graph limits
- Quasi-random graphs
- Very large graphs
- Weak regularity and finitely forcible graph limits
Cited in
(9)- Elusive extremal graphs
- Extremal k-forcing sets in oriented graphs
- EXTREMAL THEORY OF ORDERED GRAPHS
- Extremal theory of vertex or edge ordered graphs
- Weak regularity and finitely forcible graph limits
- Weak regularity and finitely forcible graph limits
- Finitely forcible graphons and permutons
- Extremal Graphs without Large Forbidden Subgraphs
- Finitely forcible graphons
This page was built for publication: Extremal graph theory and finite forcibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689971)
