The maximum number of pentagons in a planar graph
From MaRDI portal
Publication:6657591
DOI10.1002/JGT.23172MaRDI QIDQ6657591
Casey Tompkins, Oscar Zamora, Addisu Paulos, Nika Salia, Ervin Győri
Publication date: 6 January 2025
Published in: Journal of Graph Theory (Search for Journal in Brave)
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)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cliques in graphs excluding a complete graph minor
- On the maximum number of five-cycles in a triangle-free graph
- On the maximum number of cliques in a graph
- Sur le problème des courbes gauches en topologie.
- On the number of pentagons in triangle-free graphs
- The maximum number of 10- and 12-cycles in a planar graph
- On the number of cliques in graphs with a forbidden minor
- Über eine Eigenschaft der ebenen Komplexe
- 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
- Tree densities in sparse graph classes
- Subgraph densities in a surface
- Many \(T\) copies in \(H\)-free graphs
- The maximum number of paths of length three in a planar graph
- Counting paths, cycles, and blow‐ups in planar graphs
- The maximum number of copies of an even cycle in a planar graph
- Bounding the number of odd paths in planar graphs via convex optimization
Related Items (1)
This page was built for publication: The maximum number of pentagons in a planar graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657591)
