论文信息 - Chromatic number of finite and infinite graphs and hypergraphs

Chromatic number of finite and infinite graphs and hypergraphs

Abstract We wrote many papers on these subjects, some in collaboration with Galvin, Rado, Shelah and Szemerědi, and posed many problems some of which turned out to be undecidable. In this survey we state some old and new solved and unsolved problems.

Paul Erdös | András Hajnal | P. Erdös | A. Hajnal

[1] P. Erdos,et al. On chromatic number of graphs and set-systems , 1966 .

[2] P. Erdös,et al. Graph Theory and Probability , 1959 .

[3] Péter Komjáth,et al. What must and what need not be contained in a graph of uncountable chromatic number? , 1984, Comb..

[4] A. Hajnal,et al. On decomposition of graphs , 1967 .

[5] János Komlós,et al. A Note on Ramsey Numbers , 1980, J. Comb. Theory, Ser. A.

[6] Endre Szemerédi,et al. On Almost Bipartite Large Chromatic Graphs , 1982 .