Extremal graph theory and finite forcibility

DOI10.1016/j.endm.2017.07.005zbMath1379.05060OpenAlexW2622022972MaRDI QIDQ1689971

Daniel Král', Andrzej Grzesik, László Miklós Lovász

Publication date: 18 January 2018

Full work available at URL: http://wrap.warwick.ac.uk/88890/7/WRAP-external-graph-theory-finite-Kral-017.pdf

zbMATH Keywords

extremal combinatoricsgraph limits

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Weak regularity and finitely forcible graph limits
• Limits of dense graph sequences
• Finitely forcible graph limits are universal
• Bounds for graph regularity and removal lemmas
• Finitely forcible graphons
• Compactness and finite forcibility of graphons
• Moments of two-variable functions and the uniqueness of graph limits
• Generalized quasirandom graphs
• Very large graphs
• Flag algebras
• Infinite‐dimensional finitely forcible graphon
• Quasi-random graphs