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...
Autors principals: | Kim, J, Liu, H, Sharifzadeh, M, Staden, K |
---|---|
Format: | Journal article |
Publicat: |
London Mathematical Society
2017
|
Ítems similars
-
A Proof of Komlós Theorem for Super-Reflexive Valued Random Variables
per: Abdessamad Dehaj, et al.
Publicat: (2020-09-01) -
On the Komlós–Révész SLLN for Ψ-Mixing Sequences
per: Zbigniew S. Szewczak
Publicat: (2025-01-01) -
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
per: Samvel Kh. Darbinyan
Publicat: (2021-01-01) -
Analysis about the Concept of Taste's Formators. An Interpretation of Komlos' Vision
per: MIHAELA IOANA GURĂU
Publicat: (2021-12-01) -
Conjecture and proof /
per: 181611 Laczkovich, Miklos
Publicat: (2001)