Arithmetic progressions of cycles in outer-planar graphs

DOI10.1016/S0012-365X(01)00234-5MaRDI QIDQ1598841zbMATH OpenOpenAlexFDO

Authors Tristan Denley

Publication date 28 May 2002

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(01)00234-5

zbMATH Keywords

arithmetic progressioncycle spectrumouter-planar graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Arithmetic progressions (11B25)

Review text

Let \(d\geq 3\) be an integer. In connection with a 1996 problem of Paul Erdős, the author proves that there exists a constant \(c>0\) such that if \(n\) is large enough, every outer-planar graph of order \(n\), in which every internal face has size at most \(d\) and the outer face is a cycle, contains a sequence of \(\exp\{c(\log n)^{1/3}-\log\log n\}\) cycles whose lengths form an arithmetic progression.

Recommendations

• On arithmetic progressions of cycle lengths in graphs
• Cyclomatic numbers of planar graphs
• On the Number of Cycles in Planar Graphs
• Counting arithmetical structures on paths and cycles
• scientific article; zbMATH DE number 4055651
• On the maximum number of cycles in outerplanar and series-parallel graphs
• On the maximum number of cycles in outerplanar and series-parallel graphs
• scientific article; zbMATH DE number 4041954
• scientific article; zbMATH DE number 59237
• Cycles in graphs and related problems

This page was built for publication: Arithmetic progressions of cycles in outer-planar graphs

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