PROOF OF THE ERDOS MATCHING CONJECTURE IN A NEW RANGE

被引：18
|
作者：
Frankl, Peter [1 ]
机构：
[1] Hungarian Acad Sci, Alfred Renyi Inst Math, Realtanoda Utca 13-15, H-1053 Budapest, Hungary
来源：
ISRAEL JOURNAL OF MATHEMATICS | 2017年 / 222卷 / 01期
关键词：
HYPERGRAPH; NUMBER; EDGES; SETS;
D O I：
10.1007/s11856-017-1595-7
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Let s > k >= 2 be integers. It is shown that there is a positive real epsilon = epsilon(k) such that for all integers n satisfying (s + 1) k <= n < (s + 1)(k + epsilon) every k-graph on n vertices with no more than s pairwise disjoint edges has at most (((s+1)k-1)(k)) edges in total. This proves part of an old conjecture of Erdos.
引用
收藏
页码：421 / 430
页数：10
相关论文
共 50 条
12345