Hamiltonicity of Schrijver graphs and stable Kneser graphs

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

Result language
angličtina
Original language name
Hamiltonicity of Schrijver graphs and stable Kneser graphs
Original language description
For integers k>=1 and n>=2k+1, the Schrijver graph S(n,k) has as vertices all k-element subsets of [n]:={1,2,...,n} that contain no two cyclically adjacent elements, and an edge between any two disjoint sets. More generally, for integers k>=1, s>=2, and n>=sk+1, the s-stable Kneser graph S(n,k,s) has as vertices all k-element subsets of [n] in which any two elements are in cyclical distance at least s. We prove that all the graphs S(n,k,s), in particular Schrijver graphs S(n,k)=S(n,k,2), admit a Hamilton cycle that can be computed in time O(n) per generated vertex.
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)