Finitely forcible graphons with an almost arbitrary structure

DOI10.19086/da.12058zbMath1450.05042arXiv1809.05973OpenAlexW3046477764MaRDI QIDQ5126772

László Miklós Lovász, Jakub Sosnovec, Jonathan A. Noel, Daniel Král'

Publication date: 20 October 2020

Published in: Discrete Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.05973

zbMATH Keywords

extremal graph theorygraph limitsconvergent sequences of large graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Density (toughness, etc.) (05C42)

Related Items (1)

Cut distance identifying graphon parameters over weak* limits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new lower bound based on Gromov's method of selecting heavily covered points
• Testing properties of graphs and functions
• On the maximum number of five-cycles in a triangle-free graph
• Limits of dense graph sequences
• Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle
• Quick approximation to matrices and applications
• Finitely forcible graph limits are universal
• Bounds for graph regularity and removal lemmas
• On the number of pentagons in triangle-free graphs
• Finitely forcible graphons
• Compactness and finite forcibility of graphons
• Moments of two-variable functions and the uniqueness of graph limits
• Generalized quasirandom graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Non-Three-Colourable Common Graphs Exist
• On 3-Hypergraphs with Forbidden 4-Vertex Configurations
• Hypergraphs Do Jump
• A Solution to the 2/3 Conjecture
• Elusive extremal graphs
• Threshold Graph Limits and Random Threshold Graphs
• On the Minimal Density of Triangles in Graphs
• Very large graphs
• Weak regularity and finitely forcible graph limits
• A New Bound for the 2/3 Conjecture
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• Minimum Number ofk-Cliques in Graphs with Bounded Independence Number
• Flag algebras
• Infinite‐dimensional finitely forcible graphon
• Quasi-random graphs

This page was built for publication: Finitely forcible graphons with an almost arbitrary structure