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

DOI10.4153/CMB-2011-192-8zbMath1315.03077arXiv1110.6563WikidataQ122888148 ScholiaQ122888148MaRDI QIDQ4921870

François G. Dorais

Publication date: 28 May 2013

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.6563

zbMATH Keywords

comparability graphchromatic numberperfect graphchordal graphclique-cover numberGalvin conjectureRado conjecture

Mathematics Subject Classification ID

Partial orders, general (06A06) Consistency and independence results (03E35) Large cardinals (03E55) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Other combinatorial set theory (03E05)

Related Items (1)

The chain covering number of a poset with no infinite antichains

This page was built for publication: A Note on Conjectures of F. Galvin and R. Rado