Showing 2024Show all
2 papers · 1 filter
math.CO2024
Near rainbow Hamilton cycles in dense graphs
Danni Peng, Zhifei Yan
Finding near-rainbow Hamilton cycles in properly edge-coloured graphs was first studied by Andersen, who proved in 1989 that every proper edge colouring of the complete graph on $n…
math.CO2024
The chromatic number of very dense random graphs
Zhifei Yan
The chromatic number of a very dense random graph , with for some constant , was first studied by Surya and Warnke, who conjectured that the typic…