📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments (2014)

First Author: Kühn D

Attributed to: Edge-colourings and Hamilton decompositions of graphs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1112/plms/pdu019

Publication URI: http://dx.doi.org/10.1112/plms/pdu019

Type: Journal Article/Review

Parent Publication: Proceedings of the London Mathematical Society

Issue: 3