2 papers
math.CO2023
Optimal Hamilton covers and linear arboricity for random graphs
Nemanja Draganić, Stefan Glock, David Munhá Correia +1
In his seminal 1976 paper, Pósa showed that for all , the binomial random graph is with high probability Hamiltonian. This leads to the following natural…
math.CO2023
Hamilton cycles in pseudorandom graphs
Stefan Glock, David Munhá Correia, Benny Sudakov
Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any -regular …