Generalized planar Turán numbers

DOI10.37236/9603zbMath1478.05074arXiv2002.04579OpenAlexW3214774009MaRDI QIDQ2665977

Oscar Zamora, Casey Tompkins, Nika Salia, Addisu Paulos, Ervin Gyoeri

Publication date: 22 November 2021

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Turán problemmaximum number of cycles of a given length

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 (4)

Subgraph densities in a surface ⋮ 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 ⋮ Planar graphs with the maximum number of induced 6-cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the maximum number of five-cycles in a triangle-free graph
• Pentagons vs. triangles
• On the maximum number of cliques in a graph
• The maximum number of cliques in graphs without long cycles
• A note on graphs without short even cycles
• On the number of pentagons in triangle-free graphs
• Generalized Turán problems for even cycles
• Counting copies of a fixed subgraph in \(F\)-free graphs
• Planar anti-Ramsey numbers of paths and cycles
• Extremal Theta-free planar graphs
• Planar anti-Ramsey numbers of matchings
• The maximum number of paths of length four in a planar graph
• ExtremalC₄-Free/C₅-Free Planar Graphs
• M-degrees of quadrangle-free planar graphs
• On the frequency of 3-connected subgraphs of planar graphs
• On the number of cycles of lengthk in a maximal planar graph
• Connectivity, graph minors, and subgraph multiplicity
• Edge-partitions of planar graphs and their game coloring numbers
• Many H-Copies in Graphs with a Forbidden Tree
• A generalized Turán problem and its applications
• Many \(T\) copies in \(H\)-free graphs

This page was built for publication: Generalized planar Turán numbers