8 citations · 18 across the 10 of their papers we have counts for
13 papers
Developing a statistically powerful measure for quartet tree inference using phylogenetic identities and Markov invariants
Jeremy G Sumner, Amelia Taylor, Barbara R Holland +1
Recently there has been renewed interest in phylogenetic inference methods based on phylogenetic invariants, alongside the related Markov invariants. Broadly speaking, both these a…
On the exact decomposition threshold for even cycles
Amelia Taylor
A graph has a -decomposition if its edge set can be partitioned into cycles of length . We show that if , then has a -decomposition, and if…
Clique decompositions of multipartite graphs and completion of Latin squares
Ben Barber, Daniela Kühn, Allan Lo +2
Our main result essentially reduces the problem of finding an edge-decomposition of a balanced r-partite graph of large minimum degree into r-cliques to the problem of finding a fr…
On the random greedy F-free hypergraph process
Daniela Kühn, Deryk Osthus, Amelia Taylor
Let be a strictly -balanced -uniform hypergraph with and maximum co-degree at least two. The random greedy -free process constructs a maximal -fr…
Arbitrary Orientations of Hamilton Cycles in Digraphs
Louis DeBiasio, Daniela Kühn, Theodore Molla +2
Let be sufficiently large and suppose that is a digraph on vertices where every vertex has in- and outdegree at least . We show that contains every orientation…
The regularity method for graphs and digraphs
Amelia Taylor
This MSci thesis surveys results in extremal graph theory, in particular relating to Hamilton cycles. Szeméredi's Regularity Lemma plays a central role. We also investigate the rob…