Hamiltonian Kneser graphs

被引：15

作者：

Chen, YC ^{[1
]}

Füredi, Z

机构：

[1] Arizona State Univ, Dept Math, Tempe, AZ 85287 USA

[2] Hungarian Acad, Renyi Inst Math, H-1364 Budapest, Hungary

[3] Univ Illinois, Dept Math, Urbana, IL 61801 USA

来源：

COMBINATORICA | 2002年 / 22卷 / 01期

基金：

匈牙利科学研究基金会;

关键词：

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

D O I：

10.1007/s004930200007

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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 greater than or equal to 3k. In this note, we give a short proof for the case when k divides n.

引用

页码：147 / 149

页数：3