Hamiltonian Kneser Graphs

Combinatorica volume 22, pages147–149(2002)Cite this article

The Kneser graph K(n,k) has as vertices the k-subsets of {1, 2, ..., n}. Two vertices are adjacent if the corresponding k-subsets are disjoint. It was recently proved by the first author [2] that Kneser graphs have Hamilton cycles for n >= 3k. In this note, we give a short proof for the case when k divides n.

This is a preview of subscription content, access via your institution.

Access options

Buy single article

Instant access to the full article PDF.

US$ 39.95

Tax calculation will be finalised during checkout.

Author information

Affiliations

  1. Department of Mathematics, Arizona State University; Tempe, AZ 85287, USA; E-mail: cchen@math.la.asu.edu, US

    Ya-Chen Chen

  2. Rényi Institute of Mathematics, Hungarian Academy of Sciences; 1364 Budapest, Pf. 127, Hungary; E-mail: furedi@renyi.hu and Department of Mathematics, University of Illinois; Urbana, IL 61801, USA; E-mail: z-furedi@math.uiuc.edu, HU

    Z. Füredi

Authors
  1. Ya-Chen Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z. Füredi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 14, 1999

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Chen, YC., Füredi, Z. Hamiltonian Kneser Graphs. Combinatorica 22, 147–149 (2002). https://doi.org/10.1007/s004930200007

Download citation

  • AMS Subject Classification (2000) Classes:  05C45; 05C38