Proofs of Two Conjectures of Alon on Subgraph Counts
arXiv:2606.18321
Abstract
All graphs considered are finite with no isolated vertices. Let be the maximum number of subgraphs of a graph isomorphic to , taken over all graphs with edges. Alon proved that , where and , and conjectured [Conjecture 1, Isr. J. Math., 1986] that limit of exists as . We prove this conjecture and identify the limit as , where is characterized by a variational problem over finite cores. We also resolve another conjecture of Alon [Conjecture 2, Isr. J. Math., 1986], which stated that if is a disjoint union of stars, then for every an extremal graph attaining may be chosen to be a disjoint union of stars.
16 pages; comments are welcome