Excluding infinite clique minors
From MaRDI portal
Publication:4858042
DOI10.1090/memo/0566zbMath0840.05076OpenAlexW2124246362MaRDI QIDQ4858042
Neil Robertson, Robin Thomas, P. D. Seymour
Publication date: 11 December 1995
Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/memo/0566
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)
Related Items (9)
Some recent progress and applications in graph minor theory ⋮ Ends and tangles ⋮ Excluding a full grid minor ⋮ Hadwiger's conjecture for uncountable graphs ⋮ A strengthening of Halin's grid theorem ⋮ Excluding infinite minors ⋮ Excluding Infinite Trees ⋮ Minor-equivalence for infinite graphs ⋮ Excluding a countable clique
This page was built for publication: Excluding infinite clique minors