The maximum number of paths of length four in a planar graph

DOI10.1016/j.disc.2021.112317zbMath1460.05088arXiv2004.09207OpenAlexW3131159232MaRDI QIDQ2659227

Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao, Oscar Zamora, Debarun Ghosh, Ervin Gyoeri

Publication date: 25 March 2021

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

pathplanar graphgeneralized Turan number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)

Related Items (8)

Subgraph densities in a surface ⋮ Generalized planar Turán numbers ⋮ On the maximum number of edges in planar graphs of bounded degree and matching number ⋮ The maximum number of paths of length three in a planar graph ⋮ Counting paths, cycles, and blow‐ups in planar graphs ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ Generalized outerplanar Turán number of short paths ⋮ The maximum number of 10- and 12-cycles in a planar graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On 3-uniform hypergraphs without a cycle of a given length
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• On the maximal number of certain subgraphs in \(K_ r\)-free graphs
• On the number of pentagons in triangle-free graphs
• Generalized Turán problems for even cycles
• The Maximum Number of Triangles in C_2k+1-Free Graphs
• On the number of cycles of lengthk in a maximal planar graph
• A note on the maximum number of triangles in a C₅‐free graph
• A Generalized Turán Problem and its Applications
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: The maximum number of paths of length four in a planar graph