5 citations · 21 across the 17 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
math.CO2020★ 2 cited
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Δ{…
math.CO2020★ 1 cited
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…
math.CO2020
Minimum degree conditions for tight Hamilton cycles
Richard Lang, Nicolás Sanhueza-Matamala
We develop a new framework to study minimum -degree conditions in -uniform hypergraphs, which guarantee the existence of a tight Hamilton cycle. Our main theoretical result d…