5 citations · 21 across the 17 of their papers we have counts for
18 papers
Tiling dense hypergraphs
Richard Lang
The goal in the perfect tiling problem is to cover the vertices of a hypergraph with pairwise vertex-disjoint copies of a hypergraph . Prior work has identified three necess…
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…
Sufficient conditions for perfect mixed tilings
Eoin Hurley, Felix Joos, Richard Lang
We develop a method to study sufficient conditions for perfect mixed tilings. Our framework allows the embedding of bounded degree graphs with components of sublinear order. As…
On sufficient conditions for spanning structures in dense graphs
Richard Lang, Nicolás Sanhueza-Matamala
We study structural conditions in dense graphs that guarantee the existence of vertex-spanning substructures such as Hamilton cycles. It is easy to see that every Hamiltonian graph…
An Improved Bound for the Linear Arboricity Conjecture
Richard Lang, Luke Postle
In 1980, Akiyama, Exoo and Harary posited the Linear Arboricity Conjecture which states that any graph of maximum degree can be decomposed into at most $\left\lceil \fracΔ{…
Edge-colouring graphs with local list sizes
Marthe Bonamy, Michelle Delcourt, Richard Lang +1
The famous List Colouring Conjecture from the 1970s states that for every graph the chromatic index of is equal to its list chromatic index. In 1996 in a seminal paper, Kah…