Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. N. G. de Bruijn andP. Erdős, A colour problem for infinite graphs and a problem in the theory of relations,Nederl. Akad. Wetensch. Proc. Ser. A. 54=Indagationes Math. 13 (1951), 369–373.
2. P. Erdős andA. Hajnal, On chromatic number of infinite graphs,Theory of Graphs (Proc. Colloq., Tihany, Hungary, 1966, Edited by P. Erdős and G. Katona), Academic Press, New York-London; Akadémiai Kiadó, Budapest, 1968, 83–98.
3. P. Erdős andA. Hajnal, Problems and results in finite and infinite combinatorial analysis, Internat. Conference Combinatorial Math. 1970,Ann. New York Acad. Sci. 175 (1970), 115–124.
4. P. Erdős andA. Hajnal, Some remarks on set theory. IX. Combinatorial problems in measure theory and set theory,Michigan Math. J. 11 (1964), 107–127.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献