A Note on Conjectures of F. Galvin and R. Rado

Dorais, François G.

Canadian mathematical bulletin, Tome 56 (2013) no. 2, pp. 317-325

Résumé

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}}$ . Todorčević 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.

Détail

DOI : 10.4153/CMB-2011-192-8

Mots-clés : 03E05, 03E35, 03E55, Galvin conjecture, Rado conjecture, perfect graph, comparability graph, chordal graph, clique-cover number, chromatic number

Bibliographie

[1] [1] Abraham, U., A note on Dilworth's theorem in the infinite case. Order 4(1987), no. 2, 107–125. Google Scholar | DOI

[2] [2] Berge, C., Les probl`emes de coloration en théorie des graphes. Publ. Inst. Statist. Univ. Paris 9(1960), 123–160. Google Scholar

[3] [3] Chudnovsky, M., Robertson, N., Seymour, P., and Thomas, R., The strong perfect graph theorem. Ann. of Math. (2) 164(2006), no. 1, 51–229. http://dx.doi.org/10.4007/annals.2006.164.51 Google Scholar

[4] [4] Dilworth, R. P., A decomposition theorem for partially ordered sets. Ann. of Math. (2) 51(1950), 161–166. Google Scholar | DOI

[5] [5] Fulkerson, D. R. and Gross, O. A., Incidence matrices and interval graphs. Pacific J. Math. 15(1965), 835–855. Google Scholar

[6] [6] Hajnal, A. and Surańyi, J., über die Auflösung von Graphen in vollstandige Teilgraphen, Ann. Univ. Sci. Budapest. Eotvos Sect. Math. 1(1958), 113–121. Google Scholar

[7] [7] König, B., Generic compactness reformulated. Arch. Math. Logic 43(2004), no. 3, 311–326. Google Scholar | DOI

[8] [8] Lovász, L., Normal hypergraphs and the perfect graph conjecture. Discrete Math. 2(1972), no. 3, 253–267. Google Scholar | DOI

[9] [9] Lovász, L., A characterization of perfect graphs. J. Combinatorial Theory Ser. B 13(1972), 95–98. http://dx.doi.org/10.1016/0095-8956(72)90045-7 Google Scholar

[10] [10] Perles, M. A., On Dilworth's theorem in the infinite case. Israel J. Math. 1(1963), 108–109. Google Scholar | DOI

[11] [11] Pnueli, A., Lempel, A., and Even, S., Transitive orientation of graphs and identification of permutation graphs. Canad. J. Math. 23(1971), 160–175. Google Scholar | DOI

[12] [12] Rado, R., Theorems on intervals of ordered sets. Discrete Math. 35(1981), 199–201. Google Scholar | DOI

[13] [13] Todorčević, S., On a conjecture of R. Rado. J. London Math. Soc. (2) 27(1983), no. 1, 1–8. Google Scholar | DOI

[14] [14] Todorčević, S., Conjectures of Rado and Chang and cardinal arithmetic. In: Finite and infinite combinatorics in sets and logic (Banff, AB, 1991), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 411, Kluwer Acad. Publ., Dordrecht, 1993, pp. 385–398. Google Scholar

[15] [15] Todorčević, S., Combinatorial dichotomies in set theory, Bull. Symbolic Logic, 17(2011), no. 1, 1–72. Google Scholar | DOI

[16] [16] Trotter, W. T. Jr., Moore, J. I. Jr., and Sumner, D. P., The dimension of a comparability graph. Proc. Amer. Math. Soc. 60(1976), 35–38. Google Scholar | DOI

[17] [17] Wagon, S., Infinite triangulated graphs. Discrete Math. 22(1978), no. 2, 183–189. Google Scholar | DOI