Proof of Komlós's conjecture on Hamiltonian subsets

Komlós conjectured in 1981 that among all graphs with minimum degree at least d, the complete graph K d+1 minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when d is sufficiently large. In fact we prove a...

詳細記述

書誌詳細
主要な著者: Kim, J, Liu, H, Sharifzadeh, M, Staden, K
フォーマット: Journal article
出版事項: London Mathematical Society 2017

類似資料