On chromatic number of graphs and set-systems
暂无分享，去创建一个
[1] H. J. Keisler,et al. From Accessible to Inaccessible Cardinals , 1967 .
[2] A. Hajnal,et al. Partition relations for cardinal numbers , 1965 .
[3] Paul Erdős,et al. Some remarks on set theory. IX. Combinatorial problems in measure theory and set theory. , 1964 .
[4] Andras Hajnal,et al. On a property of families of sets , 1964 .
[5] Alfred Tarski,et al. From accessible to inaccessible cardinals (Results holding for all accessible cardinal numbers and the problem of their extension to inaccessible ones) , 1964 .
[6] A. Hales,et al. Regularity and Positional Games , 1963 .
[7] P. Erdös. On circuits and subgraphs of chromatic graphs , 1962 .
[8] R. Rado,et al. A Construction of Graphs without Triangles having Pre‐Assigned Order and Chromatic Number , 1960 .
[9] L. Bittner. C. Berge, Théorie des graphes et ses applications. VIII + 277 S. m. 117 Abb. Paris 1958. Dunod Editeur. Preis geb. 3400 F , 1960 .
[10] C. Berge. Théorie des graphes et ses applications , 1958 .
[11] A. Leaf. GRAPH THEORY AND PROBABILITY , 1957 .
[12] Jan Mycielski. Sur le coloriage des graphs , 1955 .
[13] G. Dirac. Some Theorems on Abstract Graphs , 1952 .
[14] Paul Erdös,et al. A colour problem for infinite graphs and a problem in the theory of relations , 1951 .
[15] A. Tarski,et al. Sur la décomposition des ensembles en sous-ensembles presque disjoints , 1928 .