On A Combinatorial Problem of Erdös
Canadian mathematical bulletin, Tome 12 (1969) no. 6, pp. 823-829
Voir la notice de l'article provenant de la source Cambridge
A family of sets is said to possess property if there exists a set such that and for every We consider the following question raised by P. Erdös |1|: let n and N be positive integers, n ≥ 2 and N ≥ 2n - 1 and let S be a set of N elements; what is the least integer (provided such an integer exists), for which there exists a family of subsets of S satisfying (a) |F| = n for each (b) (c) does not have property (d) if and then has property
Abbott, H. L.; Hanson, D. On A Combinatorial Problem of Erdös. Canadian mathematical bulletin, Tome 12 (1969) no. 6, pp. 823-829. doi: 10.4153/CMB-1969-107-x
@article{10_4153_CMB_1969_107_x,
author = {Abbott, H. L. and Hanson, D.},
title = {On {A} {Combinatorial} {Problem} of {Erd\"os}},
journal = {Canadian mathematical bulletin},
pages = {823--829},
year = {1969},
volume = {12},
number = {6},
doi = {10.4153/CMB-1969-107-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1969-107-x/}
}
Cité par Sources :