4 citations · 5 across the 3 of their papers we have counts for
10 papers · 1 filter
Cycle tilings and -factors in directed graphs
Theodore Molla, Andrew Treglown
We prove several results concerning cycle tilings and -factors in digraphs. We provide a minimum semi-degree condition for forcing a digraph to contain a given spanning collecti…
Powers of Hamilton cycles in oriented and directed graphs
Louis DeBiasio, Jie Han, Allan Lo +3
The Pósa--Seymour conjecture determines the minimum degree threshold for forcing the th power of a Hamilton cycle in a graph. After numerous partial results, Komlós, Sárközy and…
Transversal -factors in subgraphs of the balanced blow-up of
Beka Ergemlidze, Theodore Molla
For a subgraph of the blow-up of a graph , we let be the smallest minimum degree over all of the bipartite subgraphs of induced by pairs of parts that correspon…
On Even Rainbow or Nontriangular Directed Cycles
Andrzej Czygrinow, Theodore Molla, Brendan Nagle +1
Let be an -vertex edge-colored graph. In 2013, H. Li proved that if every vertex is incident to at least distinctly colored edges, then admi…
On Odd Rainbow Cycles in Edge-Colored Graphs
Andrzej Czygrinow, Theodore Molla, Brendan Nagle +1
Let be an -vertex edge-colored graph. In 2013, H. Li proved that if every vertex is incident to at least distinctly colored edges, then admi…
Transitive tournament tilings in oriented graphs with large minimum total degree
Louis DeBiasio, Allan Lo, Theodore Molla +1
Let be the transitive tournament on vertices. We show that every oriented graph on vertices with minimum total degree can be partitioned into…