Counting odd cycles in locally dense graphs
From MaRDI portal
Publication:401486
DOI10.1016/j.jctb.2013.12.002zbMath1300.05132arXiv1604.06833OpenAlexW3121868313MaRDI QIDQ401486
Publication date: 27 August 2014
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.06833
Enumeration in graph theory (05C30) Paths and cycles (05C38) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)
Related Items (3)
On some graph densities in locally dense graphs ⋮ Linear configurations containing 4-term arithmetic progressions are uncommon ⋮ Inequalities for doubly nonnegative functions
Cites Work
This page was built for publication: Counting odd cycles in locally dense graphs