Fractional clique decompositions of dense graphs and hypergraphs
Fractional clique decompositions of dense graphs and hypergraphs
复制标题
稠密图和超图的分数派分解
DOI:
10.1016/j.jctb.2017.05.005
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
Barber B
中科院分区:
文献类型:
--
作者:
Barber B
Our main result is that every graph G on n≥ 10 4 r 3 vertices with minimum degree δ (G)≥(1− 1/10 4 r 3/2) n has a fractional K r-decomposition. Combining this result with recent work of Barber, Kühn, Lo and Osthus leads to the best known minimum degree thresholds for exact (non-fractional) F-decompositions for a wide class of graphs F (including large cliques). For general k-uniform hypergraphs, we give a short argument which shows that there exists a constant c k> 0 such that every k-uniform hypergraph G on n vertices with minimum codegree at least (1− c k/r 2 k− 1) n has a fractional K r (k)-decomposition, where K r (k) is the complete k-uniform hypergraph on r vertices.(Related fractional decomposition results for triangles have been obtained by Dross and for hypergraph cliques by Dukes as well as Yuster.) All the above new results involve purely combinatorial arguments. In particular, this yields a combinatorial proof of Wilson's theorem that every large F-divisible complete graph has an F-decomposition.
登录
查看更多内容
DOI:
--
发表时间:
2015
期刊:
影响因子:
--
作者:
P. Dukes
通讯作者:
P. Dukes
DOI:
10.1017/s0963548317000165
发表时间:
2016
期刊:
Combinatorics, Probability and Computing
影响因子:
--
作者:
R. Montgomery
通讯作者:
R. Montgomery
DOI:
10.1016/j.jcta.2017.04.005
发表时间:
2017
期刊:
Journal of Combinatorial Theory, Series A
影响因子:
--
作者:
Barber B
通讯作者:
Barber B
DOI:
10.1016/j.jctb.2019.02.010
发表时间:
2019
期刊:
Journal of Combinatorial Theory, Series B
影响因子:
--
作者:
Glock S
通讯作者:
Glock S
DOI:
10.1137/15m1014310
发表时间:
2015
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
François Dross
通讯作者:
François Dross