s$-Stable Kneser Graph are Hamiltonian

The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-\text{stab}}(n, k)$ is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than $s$. In this a...

Full description

Saved in:
Bibliographic Details
Published inThe Electronic journal of combinatorics Vol. 32; no. 3
Main Authors Ledezma, Agustina V., Pastine, Adrián
Format Journal Article
LanguageEnglish
Published 22.08.2025
Online AccessGet full text

Cover

Loading…
Abstract The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-\text{stab}}(n, k)$ is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than $s$. In this article, we show that connected $s$-Stable Kneser graphs are Hamiltonian.
AbstractList The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser Graph $K_{s-\text{stab}}(n, k)$ is obtained from the Kneser graph by deleting vertices with elements at cyclic distance less than $s$. In this article, we show that connected $s$-Stable Kneser graphs are Hamiltonian.
Author Pastine, Adrián
Ledezma, Agustina V.
Author_xml – sequence: 1
  givenname: Agustina V.
  surname: Ledezma
  fullname: Ledezma, Agustina V.
– sequence: 2
  givenname: Adrián
  surname: Pastine
  fullname: Pastine, Adrián
BookMark eNpNjztPwzAUha9QkWgL_IYMqJvBj_hxR1RBi6jEQPfoxrFFUOpUdhf-PVFh6HK-ozMc6VvALI0pANwL_qisVOZJSKvwCuaCW8scSjO76DewKOWbcyER9RxW5YF9nqgdQvWeQgm52mQ6flWUQ7WlQz-cxtRTuoXrSEMJd_9cwv71Zb_est3H5m39vGPeKGQdYax91OgjxQld3VknhVW6tc4ReiMFmilpGg1vre9MrTWXzsnYklFLWP3d-jyWkkNsjrk_UP5pBG_Ocs1ZTv0CEC5Acw
ContentType Journal Article
DBID AAYXX
CITATION
DOI 10.37236/12739
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1077-8926
ExternalDocumentID 10_37236_12739
GroupedDBID -~9
29G
2WC
5GY
5VS
AAFWJ
AAYXX
ACGFO
ACIPV
ADBBV
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
BCNDV
CITATION
E3Z
EBS
EJD
FRP
GROUPED_DOAJ
H13
KWQ
M~E
OK1
OVT
P2P
REM
RNS
TR2
XSB
ID FETCH-LOGICAL-c639-da9f4cf59cfaff59d4d7821735b788a9c62196c62a21760b7cd645502882fba63
ISSN 1077-8926
IngestDate Wed Aug 27 16:25:54 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c639-da9f4cf59cfaff59d4d7821735b788a9c62196c62a21760b7cd645502882fba63
OpenAccessLink https://www.combinatorics.org/ojs/index.php/eljc/article/download/v32i3p33/pdf
ParticipantIDs crossref_primary_10_37236_12739
PublicationCentury 2000
PublicationDate 2025-08-22
PublicationDateYYYYMMDD 2025-08-22
PublicationDate_xml – month: 08
  year: 2025
  text: 2025-08-22
  day: 22
PublicationDecade 2020
PublicationTitle The Electronic journal of combinatorics
PublicationYear 2025
SSID ssj0012995
Score 2.3739326
Snippet The Kneser Graph $K(n,k)$ has as vertices all $k$-subsets of $\{1,\ldots,n\}$ and edges connecting two vertices if they are disjoint. The $s$-stable Kneser...
SourceID crossref
SourceType Index Database
Title s$-Stable Kneser Graph are Hamiltonian
Volume 32
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV07T8MwELagLDAgnuJZMlQsVSB1YycZESpUQJkK6lY5iY1AIqC2LB347Xy20yRUlXgsTnWKq8Sf4_vu7LsjpCG1Xgo5dxlLE9cXHtZBGsRuKnypoGKhFM0p33veffBvBmxQljo00SWT-CyZLowr-Q-qkAFXHSX7B2SLP4UAv4EvWiCM9lcYAwPfBV3U0U-3upTkqHmtE1A39XGurnZdgNnN8H8p50WnrH1TyRyBJ4SZLEzWkIJp38lUTl-t8_VJV_7KRPPxrNx40hLrE01Hz2bXvZVVPQmUadcorTgXYQkCqYjmqakXyPIVs_RIzgzq-YW4HVBTKqYFdhSVqma2vT6ngYpzgbBITM-h6bdMVijIv169ep-dYm8ICpTZk6T2yWzFKNPv3PSrUIwKV-hvkPWc5DsXFrFNsiSzLbLWKzLkjrfJ6biRI-dY5ByDnAPknApyO6R_1elfdt28ZoWbYFpjikfKTxSLEiUULqmfgoK1gjaLgzAUUcKhIThaASH34iBJuY4rpzB0VCx4e5fUsrdM7hGH4z7GuPRUCBMZVrQnFIw7D5-cwqjQfXIye8vhu81MMvw-fgc_3nFIVsuJcERqk9GHPAbJmsR145yom5H_AtsOI-k
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=s%24-Stable+Kneser+Graph+are+Hamiltonian&rft.jtitle=The+Electronic+journal+of+combinatorics&rft.au=Ledezma%2C+Agustina+V.&rft.au=Pastine%2C+Adri%C3%A1n&rft.date=2025-08-22&rft.issn=1077-8926&rft.eissn=1077-8926&rft.volume=32&rft.issue=3&rft_id=info:doi/10.37236%2F12739&rft.externalDBID=n%2Fa&rft.externalDocID=10_37236_12739
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1077-8926&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1077-8926&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1077-8926&client=summon