Hadwiger's conjecture for uncountable graphs
From MaRDI portal
Recommendations
- Hedetniemi's conjecture for uncountable graphs
- scientific article; zbMATH DE number 4208094
- On the Hadwiger number of infinite graphs
- The countable character of uncountable graphs
- Menger's theorem for countable graphs
- A note on uncountable chordal graphs
- The Lovász-Cherkassky theorem in countable graphs
- On the existence of countable universal graphs
- Hadwiger's conjecture for -link graphs
- Uncountable graphs and invariant measures on the set of universal countable graphs
Cites work
- A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
- Excluding infinite clique minors
- Excluding Subdivisions of Infinite Cliques
- scientific article; zbMATH DE number 3877173 (Why is no real title available?)
- scientific article; zbMATH DE number 1388192 (Why is no real title available?)
- On chromatic number of graphs and set-systems
- The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
- Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
Cited in
(5)
This page was built for publication: Hadwiger's conjecture for uncountable graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1688268)