Hamiltonicity, independence number, and pancyclicity

Details Hamiltonicity, independence number, and pancyclicity Hamiltonicity, independence number, and pancyclicity

2011-04-17

arxiv.org/abs/1104.3334v2

Mathematics

Combinatorics

Scientific paper

A graph on n vertices is called pancyclic if it contains a cycle of length l for all 3 \le l \le n. In 1972, Erdos proved that if G is a Hamiltonian graph on n > 4k^4 vertices with independence number k, then G is pancyclic. He then suggested that n = \Omega(k^2) should already be enough to guarantee pancyclicity. Improving on his and some other later results, we prove that there exists a constant c such that n > ck^{7/3} suffices.

Affiliated with

Also associated with

No associations

Rating

Hamiltonicity, independence number, and pancyclicity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Hamiltonicity, independence number, and pancyclicity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Hamiltonicity, independence number, and pancyclicity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-394421