Which graphs can be counted in \(C_4\)-free graphs?

DOI10.4310/PAMQ.2022.v18.n6.a4MaRDI QIDQ2694950

Yufei Zhao, Jacob Fox, David Conlon, Benjamin Sudakov

Publication date: 5 April 2023

Published in: Pure and Applied Mathematics Quarterly (Search for Journal in Brave)

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

zbMATH Keywords

\(\epsilon\)-regular approximation

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)

Related Items (1)

Extremal Sidon sets are Fourier uniform, with applications to partition regularity

This page was built for publication: Which graphs can be counted in \(C_4\)-free graphs?