The maximum number of paths of length three in a planar graph
From MaRDI portal
Publication:6057639
DOI10.1002/jgt.22836zbMath1522.05207arXiv1909.13539OpenAlexW4224229685WikidataQ114236131 ScholiaQ114236131MaRDI QIDQ6057639
Casey Tompkins, Addisu Paulos, Ervin Gyoeri, Nika Salia, Andrzej Grzesik, Oscar Zamora
Publication date: 5 October 2023
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.13539
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 (3)
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
- Cliques in graphs excluding a complete graph minor
- On the maximum number of five-cycles in a triangle-free graph
- Pentagons vs. triangles
- On the maximum number of cliques in a graph
- On the number of pentagons in triangle-free graphs
- On the number of cliques in graphs with a forbidden minor
- The maximum number of paths of length four in a planar graph
- Generalized planar Turán numbers
- Number of Cliques in Graphs with a Forbidden Subdivision
- On the frequency of 3-connected subgraphs of planar graphs
- On the number of cycles of length 4 in a maximal planar graph
- On the number of cycles of lengthk in a maximal planar graph
- Connectivity, graph minors, and subgraph multiplicity
- A note on the maximum number of triangles in a C5‐free graph
- The maximum number of $P_\ell$ copies in $P_k$-free graphs
- Many \(T\) copies in \(H\)-free graphs
- On the maximum number of odd cycles in graphs without smaller odd cycles
This page was built for publication: The maximum number of paths of length three in a planar graph
