共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
3.
4.
5.
7.
8.
9.
《Discrete Mathematics》2023,346(4):113304
In 1965 Erd?s asked, what is the largest size of a family of k-element subsets of an n-element set that does not contain a matching of size ? In this note, we improve upon a recent result of Frankl and resolve this problem for and . 相似文献
10.
《Discrete Mathematics》2022,345(9):112970
11.
12.
13.
14.
15.
17.
18.
19.