3 papers
math.CO2026
Monochromatic cycle partitions in 3-mean edge-colourings
Richard Lang, Guilherme Oliveira Mota
Given and an edge-coloured complete graph such that the average number of colours incident with a vertex is at most , Conlon and Stein asked whether there is…
math.CO2026
Dirac subgraphs of powers of cycles are Hamiltonian
Richard Lang, Alp Müyesser, Mathias Schacht +1
We show that, for every and all sufficiently large , any spanning subgraph of the th power of a cycle with minimum degree at least contains…
math.CO2025
Tight Hamiltonicity from dense links of triples
Richard Lang, Mathias Schacht, Jan Volec
We show that for all , , and sufficiently large, every -uniform hypergraph on vertices in which each set of vertices is contained in at le…