On the number of edges in a \(K_5\)-minor-free graph of given girth

DOI10.1016/J.DISC.2024.114042zbMATH Open1539.05054MaRDI QIDQ6542053

János Barát

Publication date: 21 May 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Could not fetch data.

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph minors (05C83)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Extremal results regarding \(K_6\)-minors in graphs of girth at least 5
• Lower bound of the Hadwiger number of graphs by their average degree
• Girth in graphs
• Topological subgraphs in graphs of large girth
• The extremal functions for triangle-free graphs with excluded minors
• The extremal function for complete minors
• 3-list-coloring planar graphs of girth 5
• The extremal function for \(K_{9}\) minors
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Über eine Eigenschaft der ebenen Komplexe
• Extremal \(K_4\)-minor-free graphs without short cycles
• An extremal function for contractions of graphs
• Minors in graphs of large girth

This page was built for publication: On the number of edges in a \(K_5\)-minor-free graph of given girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6542053)