Tiling transitive tournaments and their blow-ups

DOI10.1023/B:ORDE.0000009250.31770.34zbMath1041.05043arXivmath/0210338OpenAlexW2086436037MaRDI QIDQ1425167

Raphael Yuster

Publication date: 15 March 2004

Published in: Order (Search for Journal in Brave)

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

zbMATH Keywords

tournamentfactor

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

A note on some embedding problems for oriented graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Cyclic triangle factors in regular tournaments ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree

This page was built for publication: Tiling transitive tournaments and their blow-ups