A note on conjectures of F. Galvin and R. Rado

Details A note on conjectures of F. Galvin and R. Rado A note on conjectures of F. Galvin and R. Rado

2011-10-29

arxiv.org/abs/1110.6563v1

Mathematics

Logic

To appear in the Canadian Mathematical Bulletin

Scientific paper

10.4153/CMB-2011-192-8

In 1968, Galvin conjectured that an uncountable poset $P$ is the union of countably many chains if and only if this is true for every subposet $Q \subseteq P$ with size $\aleph_1$. In 1981, Rado formulated a similar conjecture that an uncountable interval graph $G$ is countably chromatic if and only if this is true for every induced subgraph $H \subseteq G$ with size $\aleph_1$. 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.

Affiliated with

Also associated with

No associations

Rating

A note on conjectures of F. Galvin and R. Rado does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A note on conjectures of F. Galvin and R. Rado, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A note on conjectures of F. Galvin and R. Rado will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-12573