Forbidding multiple copies of forestable graphs

DOI10.1007/s00373-019-02129-9zbMath1439.05115OpenAlexW2998912005WikidataQ126384520 ScholiaQ126384520MaRDI QIDQ2175780

Nathan Kettle, Neal Bushaw

Publication date: 30 April 2020

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-019-02129-9

zbMATH Keywords

bipartitecyclesforbidden subgraphextremalTuránforestable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turán numbers for disjoint copies of graphs
• A contribution to the Zarankiewicz problem
• Extremal graphs with no \(C^{4,}\)s, \(C^{6,}\)s, or \(C^{10,}\)s
• Norm-graphs: Variations and applications
• Cycles of even length in graphs
• New asymptotics for bipartite Turán numbers
• On the number of edges of quadrilateral-free graphs
• The Turán number of disjoint copies of paths
• Norm-graphs and bipartite Turán numbers
• Turán Numbers of Multiple Paths and Equibipartite Forests
• An Upper Bound on Zarankiewicz' Problem
• Minimal Regular Graphs of Girths Eight and Twelve
• On Graphs that do not Contain a Thomsen Graph
• On a problem of K. Zarankiewicz
• On the theory of graphs
• On the structure of linear graphs

This page was built for publication: Forbidding multiple copies of forestable graphs