共 50 条
On non-trivial families without a perfect matching
被引:2
|作者:
Frankl, Peter
[1
]
机构:
[1] Renyi Inst, Budapest, Hungary
关键词:
INTERSECTION-THEOREMS;
ERDOS;
HYPERGRAPH;
SYSTEMS;
EDGES;
D O I:
10.1016/j.ejc.2019.103044
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let k >= 2, s >= 3 and n = ks be integers. For s > s(0)(k) we determine the maximum of vertical bar f vertical bar for F subset of (([n])(k)) not having a perfect matching nor an isolated vertex. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页数:10
相关论文