Hadwiger's conjecture for uncountable graphs (Q1688268): Difference between revisions

@@ Property / cites work @@
+On chromatic number of graphs and set-systems
@@ Property / cites work: On chromatic number of graphs and set-systems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3344197
@@ Property / cites work: Q3344197 / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of the product of two \(\aleph _ 1\)-chromatic graphs can be countable
+Normal rank
@@ Property / cites work @@
+Q4933740
@@ Property / cites work: Q4933740 / rank @@
+Normal rank
@@ Property / cites work @@
+Unterteilungen vollständiger Graphen in Graphen mit unendlicher chromatischer Zahl
+Normal rank
@@ Property / cites work @@
+Excluding Subdivisions of Infinite Cliques
@@ Property / cites work: Excluding Subdivisions of Infinite Cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Excluding infinite clique minors
@@ Property / cites work: Excluding infinite clique minors / rank @@
+Normal rank
@@ Property / cites work @@
+A compactness theorem for singular cardinals, free algebras, Whitehead problem and transversals
+Normal rank