A Sharp Bound for the Circumference in t-tough graphs with t>1

Abstract: It is proved that if

G

is a

t

-tough graph of order

n

and minimum degree

d e l t a

with

t > 1

then either

G

has a cycle of length at least

m i n n, 2 d e l t a + 5

or

G

is the Petersen graph.

This page was built for publication: A Sharp Bound for the Circumference in $t$-tough graphs with $t>1$