The typical structure of dense claw-free graphs
Will Perkins, Sam van der Poel

TL;DR
This paper investigates the asymptotic enumeration and typical structure of dense claw-free graphs, revealing phase transitions and characterizing the most probable structures via graphon analysis.
Contribution
It provides the first asymptotic formula for the number of dense claw-free graphs and characterizes their typical structure through a detailed graphon variational analysis.
Findings
Identifies a second-order phase transition at a specific edge density.
Derives a large-deviation rate function for claw-freeness in Erdős-Rényi graphs.
Pinpoints unique optimal graphons describing typical structures at critical points.
Abstract
We analyze the asymptotic number and typical structure of claw-free graphs at constant edge densities. The first of our main results is a formula for the asymptotics of the logarithm of the number of claw-free graphs of edge density . We show that the problem exhibits a second-order phase transition at edge density . The asymptotic formula arises by solving a variational problem over graphons. For there is a unique optimal graphon, while for there is an infinite set of optimal graphons. By analyzing more detailed structure, we prove that for , there is in fact a unique graphon such that almost all claw-free graphs at edge density are close in cut metric to . We also analyze the probability of claw-freeness in the Erd\H{o}s-R\'enyi random graph for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph theory and applications · Graph Labeling and Dimension Problems
