TRANSITIVE TOURNAMENT TILINGS IN ORIENTED GRAPHS WITH LARGE MINIMUM TOTAL DEGREE

被引：0
|
作者：
DeBiasio, Louis [1 ]
Lo, Allan [2 ]
Molla, Theodore [3 ]
Treglown, Andrew [4 ]
机构：
[1] Miami Univ, Dept Math, Oxford, OH 45056 USA
[2] Univ Birmingham, Sch Math, Birmingham B15 2TT, W Midlands, England
[3] Univ S Florida, Dept Math & Stat, Tampa, FL 33620 USA
[4] Univ Birmingham, Birmingham, W Midlands, England
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2021年 / 35卷 / 01期
基金：
英国工程与自然科学研究理事会;
关键词：
tournaments; linear programming; oriented ramsey; absorbing; fractional matching; tiling ramsey; COMBINATORIAL;
D O I：
10.1137/19M1269257
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Let (T) over right arrow (k) be the transitive tournament on k vertices. We show that every oriented graph on n = 4m vertices with minimum total degree (11/12+ o(1))n can be partitioned into vertex disjoint (T) over right arrow (4)'s, and this bound is asymptotically tight. We also improve the best known bound on the minimum total degree for partitioning oriented graphs into vertex disjoint (T) over right arrow (k)'s.
引用
收藏
页码：250 / 266
页数：17
相关论文
共 50 条
12345