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...
Asıl Yazarlar: | Kim, J, Liu, H, Sharifzadeh, M, Staden, K |
---|---|
Materyal Türü: | Journal article |
Baskı/Yayın Bilgisi: |
London Mathematical Society
2017
|
Benzer Materyaller
-
A Proof of Komlós Theorem for Super-Reflexive Valued Random Variables
Yazar:: Abdessamad Dehaj, ve diğerleri
Baskı/Yayın Bilgisi: (2020-09-01) -
On the Komlós–Révész SLLN for Ψ-Mixing Sequences
Yazar:: Zbigniew S. Szewczak
Baskı/Yayın Bilgisi: (2025-01-01) -
A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
Yazar:: Samvel Kh. Darbinyan
Baskı/Yayın Bilgisi: (2021-01-01) -
Analysis about the Concept of Taste's Formators. An Interpretation of Komlos' Vision
Yazar:: MIHAELA IOANA GURĂU
Baskı/Yayın Bilgisi: (2021-12-01) -
Conjecture and proof /
Yazar:: 181611 Laczkovich, Miklos
Baskı/Yayın Bilgisi: (2001)