Counting odd cycles in sparse pseudorandom graphs

DOI10.1090/PROC/17216MaRDI QIDQ6896443zbMATH OpenFDO

Authors Sören Berger, Joonkyung Lee, M. Schacht

Publication date 21 November 2025

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/PROC/17216

zbMATH Keywords

Ramsey multiplicity of odd cyclesSidorenko's theorem

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Density (toughness, etc.) (05C42) Random graphs (graph-theoretic aspects) (05C80)

Cites work

• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A generalization of Turán's theorem
• Approximating the independence number via the -function
• Cycles in graphs and functional inequalities
• Explicit Concentrators from Generalized N-Gons
• Explicit Ramsey graphs and orthonormal labelings
• Extremal results for odd cycles in sparse pseudorandom graphs
• Extremal results in sparse pseudorandom graphs
• scientific article; zbMATH DE number 903461 (Why is no real title available?)
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Multiplicities of subgraphs
• Non-three-colourable common graphs exist
• On the Ramsey multiplicities of graphs—problems and recent results
• Pseudo-random graphs
• Regularity inheritance in pseudorandom graphs
• Resilient pancyclicity of random and pseudorandom graphs

This page was built for publication: Counting odd cycles in sparse pseudorandom graphs

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