共 50 条
A universal bound concerning t-intersecting families
被引:0
作者:
Frankl, P.
[1
]
机构:
[1] Alfred Renyi Inst Math, Realtanoda U 13-15, H-1953 Budapest, Hungary
关键词:
finite set;
intersection;
extremal problem;
SYSTEMS;
D O I:
10.1007/s10474-023-01373-z
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A very short inductive proof is given for the maximal size of a k-graph on n vertices in which any two edges overlap in at least t vertices.
引用
收藏
页码:200 / 202
页数:3
相关论文
共 50 条