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 条

[1] Strong k-transitive oriented graphs with large minimum degree
Daamouch, Moussa
COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024,
[2] Transitive triangle tilings in oriented graphs
Balogh, Jozsef
Lo, Allan
Molla, Theodore
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 124 : 64 - 87
[3] SUBDIVISIONS OF GRAPHS WITH LARGE MINIMUM DEGREE
THOMASSEN, C
JOURNAL OF GRAPH THEORY, 1984, 8 (01) : 23 - 28
[4] *-graphs of vertices of the generalized transitive tournament polytope
Borobia, A
Chumillas, V
DISCRETE MATHEMATICS, 1998, 179 (1-3) : 49 - 57
[5] Total domination in graphs with minimum degree three
Favaron, O
Henning, MA
Mynhart, CM
Puech, J
JOURNAL OF GRAPH THEORY, 2000, 34 (01) : 9 - 19
[6] Edge coloring graphs with large minimum degree
Plantholt, Michael J.
Shan, Songling
JOURNAL OF GRAPH THEORY, 2023, 102 (04) : 611 - 632
[7] Extraconnectivity of graphs with large minimum degree and girth
Balbuena, C
Carmona, A
Fabrega, J
Fiol, MA
DISCRETE MATHEMATICS, 1997, 167 : 85 - 100
[8] Matching Cut in Graphs with Large Minimum Degree
Chen, Chi-Yeh
Hsieh, Sun-Yuan
Le, Hoang-Oanh
Le, Van Bang
Peng, Sheng-Lung
ALGORITHMICA, 2021, 83 (05) : 1238 - 1255
[9] Contractible cycles in graphs with large minimum degree
Egawa, Y
DISCRETE MATHEMATICS, 1997, 171 (1-3) : 103 - 119
[10] Matching Cut in Graphs with Large Minimum Degree
Chi-Yeh Chen
Sun-Yuan Hsieh
Hoang-Oanh Le
Van Bang Le
Sheng-Lung Peng
Algorithmica, 2021, 83 : 1238 - 1255

← 1 2 3 4 5 →