Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree

DOI10.1137/19M1269257zbMath1459.05101arXiv1906.07648OpenAlexW3130381931MaRDI QIDQ5854457

Theodore Molla, Louis DeBiasio, Andrew Treglown, Allan Lo

Publication date: 17 March 2021

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.07648

zbMATH Keywords

linear programmingabsorbingtournamentsfractional matchingoriented Ramseytiling Ramsey

Mathematics Subject Classification ID

Linear programming (90C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20) Fractional graph theory, fuzzy graph theory (05C72)

Uses Software

• nauty
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Large matchings in uniform hypergraphs and the conjectures of Erdős and samuels
• Combinatorial and computational aspects of graph packing and graph decomposition
• Triangle packings and 1-factors in oriented graphs
• Decomposition of large combinatorial structures
• On tournaments free of large transitive subtournaments
• Tiling transitive tournaments and their blow-ups
• Transitive triangle tilings in oriented graphs
• Cyclic triangle factors in regular tournaments
• \(F\)-factors in hypergraphs via absorption
• Practical graph isomorphism. II.
• A note on some embedding problems for oriented graphs
• TILING DIRECTED GRAPHS WITH TOURNAMENTS
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
• On Directed Versions of the Hajnal–Szemerédi Theorem
• Independent directed triangles in a directed graph

This page was built for publication: Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree