Dense minors in graphs of large girth

DOI10.1007/s00493-005-0009-3zbMath1065.05086OpenAlexW1988593200MaRDI QIDQ558318

Reinhard Diestel, Christof Rempel

Publication date: 5 July 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-005-0009-3

zbMATH Keywords

dense minors

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph minors (05C83)

Related Items (11)

Coloring and Covering Nowhere Dense Graphs ⋮ Complete Minors in Graphs Without Sparse Cuts ⋮ A Note on Circular Chromatic Number of Graphs with Large Girth and Similar Problems ⋮ On the Hadwiger's conjecture for graph products ⋮ Some recent progress and applications in graph minor theory ⋮ Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets ⋮ Tight bounds for divisible subdivisions ⋮ Erdös--Pósa from Ball Packing ⋮ Girth and treewidth ⋮ Hadwiger number and the Cartesian product of graphs ⋮ Colouring and Covering Nowhere Dense Graphs

This page was built for publication: Dense minors in graphs of large girth