Matchings in Hypercubes Extend to Long Cycles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F25%3A10504454" target="_blank" >RIV/00216208:11320/25:10504454 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ajWcHw7Q0T" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=ajWcHw7Q0T</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1137/24M1670093" target="_blank" >10.1137/24M1670093</a>

Result language
angličtina
Original language name
Matchings in Hypercubes Extend to Long Cycles
Original language description
The 𝑑-dimensional hypercube graph 𝑄𝑑 has as vertices all subsets of {1,…,𝑑} , and an edge between any two sets that differ in a single element. The Ruskey–Savage conjecture asserts that every matching of 𝑄𝑑 , 𝑑 ≥2, can be extended to a Hamilton cycle, i.e., to a cycle that visits every vertex exactly once. We prove that every matching of 𝑄𝑑 , 𝑑 ≥2, can be extended to a cycle that visits at least a 2/3-fraction of all vertices.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA22-15272S" target="_blank" >GA22-15272S: Principles of combinatorial generation</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)