Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference4 articles.
1. N. G. de Bruijn andP. Erdős, On a combinatorial problem,Indagationes Math. 10 (1948), 421–423.
2. P. Erdős, Problems and results in graph theory and combinatorial analysis, in:Graph Theory and Related Topics (J. A. Bondy and U.S.R. Murty, eds.), Academic Press, (1978), 153–163.
3. D. E. Woolbright, On the size of partial parallel classes in Steiner systems,Topics in Steiner Systems (C.C. Lindner and A. Rosa, eds.),Annals of Discrete Math. 7 (1980), 203–211.
4. N. Hindman, On a conjecture of Erdős, Faber and Lovász about n-colorings,Canadian J. Math. 33 (1981), 563–570.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献