LONG CYCLES IN VERTEX-TRANSITIVE GRAPHS

被引：17

作者：

BABAI, L

机构：

来源：

JOURNAL OF GRAPH THEORY | 1979年 / 3卷 / 03期

关键词：

D O I：

10.1002/jgt.3190030314

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

We prove that every connected vertex‐transitive graph on n ≥ 4 vertices has a cycle longer than (3n)1/2. The correct order of magnitude of the longest cycle seems to be a very hard question. Copyright © 1979 Wiley Periodicals, Inc., A Wiley Company

引用

页码：301 / 304

页数：4

共 11 条

[1]

BABAI L, 1978, THEORY APPLICATION G, V642, P10

[2]

BABAI L, UNPUBLISHED

[3] 3 REMARKABLE GRAPHS [J].

BIGGS, N .

CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1973, 25 (02) :397-411

[4]

BONDY A, UNPUBLISHED

[5]

BONDY A, COMMUNICATION

[6] DEFECT-D MATCHINGS IN GRAPHS [J].

LITTLE, CHC ;

GRANT, DD ;

HOLTON, DA .

DISCRETE MATHEMATICS, 1975, 13 (01) :41-54

[7] ON THE SHANNON CAPACITY OF A GRAPH [J].

LOVASZ, L .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1979, 25 (01) :1-7

[8]

Lovasz L., 1979, COMBINATORIAL PROBLE

[9] PROPERTY OF ATOMS OF FINITE GRAPHS [J].

MADER, W .

ARCHIV DER MATHEMATIK, 1971, 22 (03) :333-&

[10]

Walther H., 1974, KREISE GRAPHEN

← 1 2 →