Extremal \(H\)-free planar graphs

zbMath1412.05051arXiv1808.01487MaRDI QIDQ2415071

Yongxin Lan, Yongtang Shi, Zi-Xia Song

Publication date: 20 May 2019

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

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Planar Turán numbers of cycles: a counterexample, Planar Turán Number of the 6-Cycle, On the maximum number of edges in planar graphs of bounded degree and matching number, Extremal \(P_8\)-free/\(P_9\)-free planar graphs, Outerplanar Turán numbers of cycles and paths, Planar Turán numbers of cubic graphs and disjoint union of cycles, Unnamed Item, Planar Turán number of the disjoint union of cycles, Rainbow numbers for paths in planar graphs, Rainbow numbers for small graphs in planar graphs, Planar Turán numbers on short cycles of consecutive lengths, Planar Turán numbers of short paths, Planar Turán number of intersecting triangles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on Turán numbers for even wheels
• Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
• Turán problems and shadows. I: Paths and cycles
• Extremal graphs for intersecting cliques
• Turán numbers for odd wheels
• Extremal graphs for intersecting triangles
• Hypergraph Turán numbers of linear cycles
• ExtremalC₄-Free/C₅-Free Planar Graphs
• On Planar Graphical Degree Sequences
• On the structure of linear graphs