Balanced supersaturation and Turan numbers in random graphs

DOI10.19086/AIC.2024.3arXiv2208.10572MaRDI QIDQ6408513FDOQ6408513

Authors: Tao Jiang 

Publication date: 22 August 2022

Abstract: In a ground-breaking paper solving a conjecture of ErdH{o}s on the number of $n$-vertex graphs not containing a given even cycle, Morris and Saxton cite{MS} made a broad conjecture on so-called balanced supersaturation property of a bipartite graph $H$. Ferber, McKinley, and Samotij cite{FMS} established a weaker version of this conjecture and applied it to derive far-reaching results on the enumeration problem of $H$-free graphs. In this paper, we show that Morris and Saxton's conjecture holds under a very mild assumption about $H$, which is widely believed to hold whenever $H$ contains a cycle. We then use our theorem to obtain enumeration results and general upper bounds on the Tur'an number of a bipartite $H$ in the random graph $G(n,p)$, the latter being first of its kind.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35)

This page was built for publication: Balanced supersaturation and Turan numbers in random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6408513)