A note on conjectures of F. Galvin and R. Rado
By F. G. Dorais
Canadian Mathematical Bulletin 56 (2013), no. 2, 317–325
In 1968, Galvin conjectured that an uncountable poset is the union of countably many chains if and only if this is true for every subposet with size . In 1981, Rado formulated a similar conjecture that an uncountable interval graph is countably chromatic if and only if this is true for every induced subgraph with size . Todorcevic has shown that Rado’s Conjecture is consistent relative to the existence of a supercompact cardinal, while the consistency of Galvin’s Conjecture remains open. In this paper, we survey and collect a variety of results related to these two conjectures. We also show that the extension of Rado’s conjecture to the class of all chordal graphs is relatively consistent with the existence of a supercompact cardinal.