11 citations · 29 across the 14 of their papers we have counts for
20 papers
Maximizing in graphs with fixed edge density
József Balogh, Andrzej Grzesik, Bernard Lidický +3
For every integer , and , we asymptotically determine the maximum proportion of -element sets of vertices that induce either a clique or an independent set in…
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…
Powers of Hamiltonian cycles in multipartite graphs
Louis DeBiasio, Ryan Martin, Theodore Molla
We prove that if is a -partite graph on vertices in which all of the parts have order at most and every vertex is adjacent to at least a proportion of…
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…