University of Cambridge > Talks.cam > Combinatorics Seminar > Pancyclicity of highly connected graphs

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Pancyclicity of highly connected graphs

Download to your calendar using vCal

  • UserShoham Letzter (UCL)
  • ClockThursday 12 October 2023, 14:30-15:30
  • HouseMR12.

If you have a question about this talk, please contact .

A classic result of Chvatál and Erdős (1972) asserts that, if the vertex-connectivity of a graph G is at least as large as its independence number, then G has a Hamilton cycle. We prove that a similar condition implies that a graph G is pancyclic, namely it contains cycles of all lengths between 3 and |G|: we show that if |G| is large and the vertex-connectivity of G is larger than its independence number, then G is pancyclic. This confirms a conjecture of Jackson and Ordaz (1990) for large graphs.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

yk449 Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ in Room GS1 Frankopan Hall, West Court, Jesus College, Jesus Lane, Cambridge, CB5 8BL

Other talks

Summer Cactus & Succulent Show Max Perutz Lecture - Title TBC Title to be confirmed Title to be confirmed Title to be confirmed Title TBC
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity