Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference10 articles.
1. N. G. de Bruijn andP. Erdös. A colour problem for infinite graphs and a problem in theory of relations,Nederl. Akad. Wetensch. Proc. Ser. A. 54 (1951), 371–363.
2. H. T. Croft, Incidence incidents,Eureka (Cambridge) 30 (1967), 22–26.
3. P. Erdös andM. Simonovits, On the cromatic number of geometric graphs,Ars Combinatoria. 9 (1980), 229–246.
4. K. F. Falconer, The realization of distances in measurable subsets coveringR n .J. Comb. Theory A 31, 187–189.
5. P. Frankl andR. M. Wilson, Intersection theorems with geometric consequences,Combinatorica 1 (4) (1981), 357–368.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献