Elusive extremal graphs

Abstract

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph. This statement is often referred to as saying that `every extremal graph theory problem has a finitely forcible optimum'. We present a counterexample to the conjecture. Our techniques also extend to a more general setting involving other types of constraints.

References in corpus (12)

• Estimating and understanding exponential random graph models
• On the Number of Pentagons in Triangle-Free Graphs
• Phase transitions in a complex network
• On replica symmetry of large deviations in random graphs
• The Asymptotics of Large Constrained Graphs
• Upper bounds on the size of 4- and 6-cycle-free subgraphs of the hypercube
• Non-three-colorable common graphs exist
• Maximum density of an induced 5-cycle is achieved by an iterated blow-up of a 5-cycle
• Asymptotic Structure of Graphs with the Minimum Number of Triangles
• A new lower bound based on Gromov's method of selecting heavily covered points
• Singularities in the entropy of asymptotically large simple graphs
• Infinite dimensional finitely forcible graphon