43 citations · 235 across the 46 of their papers we have counts for
4 papers · 2 filters
Antipaths in oriented graphs
Tereza Klimošová, Maya Stein
We show that for any natural number , any oriented graph of minimum semidegree at least contains an antidirected path of length . In fact, a slightly we…
Antidirected subgraphs of oriented graphs
Maya Stein, Camila Zárate-Guerén
We show that for every every sufficiently large -vertex oriented graph D of minimum semidegree exceeding contains every balanced antidirected tree with e…
Monochromatic paths in -edge coloured graphs and hypergraphs
Maya Stein
We answer a question of Gyárfás and Sárközy from 2013 by showing that every 2-edge-coloured complete 3-uniform hypergraph can be partitioned into two monochromatic tight paths of d…
Partitioning a 2-edge-coloured graph of minimum degree into three monochromatic cycles
Peter Allen, Julia Böttcher, Richard Lang +2
Lehel conjectured in the 1970s that every red and blue edge-coloured complete graph can be partitioned into two monochromatic cycles. This was confirmed in 2010 by Bessy and Thomas…