Projects per year
Abstract
Let T→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→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→k's.
Original language | English |
---|---|
Pages (from-to) | 250–266 |
Number of pages | 17 |
Journal | SIAM Journal on Discrete Mathematics |
Volume | 35 |
Issue number | 1 |
DOIs | |
Publication status | Published - 22 Feb 2021 |
Keywords
- absorbing
- fractional matching
- linear programming
- oriented ramsey
- tiling ramsey
- tournaments
Fingerprint
Dive into the research topics of 'Transitive tournament tilings in oriented graphs with large minimum total degree'. Together they form a unique fingerprint.Projects
- 2 Finished
-
A graph theoretical approach for combinatorial designs
Lo, A. (Principal Investigator)
Engineering & Physical Science Research Council
1/11/16 → 31/10/18
Project: Research Councils
-
EPSRC Fellowship: Dr Andrew Treglown - Independence in groups, graphs and the integers
Treglown, A. (Principal Investigator)
Engineering & Physical Science Research Council
1/06/15 → 31/05/18
Project: Research Councils