Asymptotic density of graphs excluding disconnected minors

DOI10.1016/j.jctb.2020.09.007zbMath1457.05060arXiv1903.03908OpenAlexW3088736520MaRDI QIDQ2221924

Rohan Kapadia, Serguei Norine, Yingjie Qian

Publication date: 3 February 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

cyclescomplete graphsasymptotic densityextremal functiongraph minors

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph minors (05C83) Density (toughness, etc.) (05C42)

Related Items (2)

Graph partitions under average degree constraint ⋮ Extremal functions for sparse minors

Cites Work

• Unnamed Item
• Average degree conditions forcing a minor
• Densities of minor-closed graph families
• Forcing unbalanced complete bipartite minors
• Lower bound of the Hadwiger number of graphs by their average degree
• Disjoint unions of complete minors
• On \(K_{s,t}\)-minors in graphs with given average degree
• Hadwiger's conjecture is true for almost every graph
• The extremal function for unbalanced bipartite minors
• The extremal function for complete minors
• A lower bound on the average degree forcing a minor
• The extremal function for noncomplete minors
• Disjoint complete minors and bipartite minors
• The extremal function for disconnected minors
• The extremal function for \(K_{9}\) minors
• Homomorphiesätze für Graphen
• Homomorphism theorems for graphs
• On maximal paths and circuits of graphs
• An extremal function for contractions of graphs
• Cycles of Given Size in a Dense Graph
• Contractions to k₈

This page was built for publication: Asymptotic density of graphs excluding disconnected minors