arXiv:1609.03556 [math.CO]AbstractReferencesReviewsResources Hadwiger's conjecture: finite vs infinite graphs Dominic van der Zypen Published 2016-09-11Version 1 We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs. Comments: 5 pages Categories: math.CO Subjects: 05C15, 05C83 Keywords: hadwigers conjecture, infinite graphs Related articles: Most relevant | Search more arXiv:1911.01491 [math.CO] (Published 2019-11-04) Halfway to Hadwiger's Conjecture Luke Postle arXiv:2208.07338 [math.CO] (Published 2022-08-15) Every graph with no $\mathcal{K}_8^{-4}$ minor is $7$-colorable Michael Lafferty, Zi-Xia Song arXiv:1312.2829 [math.CO] (Published 2013-12-10, updated 2013-12-12) A weak form of Hadwiger's conjecture Dominic van der Zypen Links Abstract on arXiv.org View preprint PDF Download TeX source Export citation in BibTeX Save eprint metadata as JSON Toolbox Post your review for this article Attach supplementary resources Edit our extended metadata Share this article on social media FacebookGoogle+LinkedInRedditTwitterVK Scan the QR code for this page
![QR code for arXiv:1609.03556 [math.CO]](http://oss.arxitics.com/images/favicon.svg)