Hadwiger's conjecture for uncountable graphs
From MaRDI portal
Publication:1688268
DOI10.1007/s12188-016-0170-1zbMath1437.03145OpenAlexW2555068509WikidataQ123005695 ScholiaQ123005695MaRDI QIDQ1688268
Publication date: 5 January 2018
Published in: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12188-016-0170-1
Consistency and independence results (03E35) Graph minors (05C83) Other combinatorial set theory (03E05) Other classical set theory (including functions, relations, and set algebra) (03E20)
Cites Work
- The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
- Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
- Excluding Subdivisions of Infinite Cliques
- Excluding infinite clique minors
- On chromatic number of graphs and set-systems
- Unnamed Item
- Unnamed Item