Transitive triangle tilings in oriented graphs
From MaRDI portal
Publication:1989953
DOI10.1016/j.jctb.2016.12.004zbMath1398.05156arXiv1401.0460OpenAlexW2254239669MaRDI QIDQ1989953
József Balogh, Theodore Molla, Allan Lo
Publication date: 29 October 2018
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.0460
Related Items (6)
On directed versions of the Corrádi-Hajnal corollary ⋮ Triangle factors of graphs without large independent sets and of weighted 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
Cites Work
- Unnamed Item
- Unnamed Item
- On directed versions of the Corrádi-Hajnal corollary
- Combinatorial and computational aspects of graph packing and graph decomposition
- Perfect matchings in large uniform hypergraphs with large minimum collective degree
- Triangle packings and 1-factors in oriented graphs
- A note on some embedding problems for oriented graphs
- Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs
- On Directed Versions of the Hajnal–Szemerédi Theorem
- On the maximal number of independent circuits in a graph
- Independent directed triangles in a directed graph
This page was built for publication: Transitive triangle tilings in oriented graphs
