Chromatic numbers of graphs — large gaps
暂无分享,去创建一个
[1] M. Foreman,et al. Handbook of Set Theory , 2010 .
[2] Assaf Rinot,et al. The Ostaszewski square and homogeneous Souslin trees , 2011, 1105.2944.
[3] Péter Komjáth. Subgraph chromatic number , 1999, Set Theory: The Hajnal Conference.
[4] P. Komjáth. Consistency results on infinite graphs , 1988 .
[5] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .
[6] Chromatic numbers of subgraphs , 1973 .
[7] William J. Mitchell,et al. The Covering Lemma , 2010 .
[8] Stevo Todorcevic,et al. Comparing the Continuum with the First Two Uncountable Cardinals , 1997 .
[9] James E. Baumgartner,et al. Generic graph construction , 1984, Journal of Symbolic Logic.
[10] Stephen Watson,et al. Set Theory and its Applications , 1989 .
[11] Assaf Rinot,et al. Jensen's diamond principle and its relatives , 2009, 0911.2151.
[12] P. Erdos,et al. On chromatic number of graphs and set-systems , 1966 .
[13] Stevo Todorcevic,et al. Combinatorial Dichotomies in Set Theory , 2011, The Bulletin of Symbolic Logic.
[14] S. Shelah. A Tribute to Paul Erdős: Incompactness for chromatic numbers of graphs , 1990 .
[15] Matthew Foreman,et al. Some downwards transfer properties for N2 , 1988 .