(University College London) at the Discrete Mathematics seminar, KIT,
Germany.
https://www.math.kit.edu/iag6/edu/agdiscrmath2024w/
*Title:* Pancyclicity of highly connected graphs.
*Abstract:* A well known result due to Erdős and Chvatál (1972) asserts
that if the vertex connectivity of a graph is at least as large as its
independence number, then the graph has a Hamilton cycle. We extend this by
showing that if the graph has sufficiently many vertices and its vertex
connectivity is strictly larger than the independence number, then the
graph is pancyclic, meaning that it has a cycle of length l for every l
between 3 and the order of the graph. This proves a conjecture of Jackson
and Ordaz (1990) for large graphs, and improves upon a recent result of
Draganić, Munhá-Correia and Sudakov.
The seminar will take place on Zoom on Thursday, February 6 at 14:00 CET.
Join Zoom Meeting
https://kit-lecture.zoom-x.de/j/4341534439?pwd=WS2sFvtCTK230vatxHgdz7784z54HD.1&omn=67915057699
Meeting ID: 434 153 4439
Passcode: @89aKPFG
Kind regards,
Maria Aksenovich and Arsenii Sagdeev (KIT)
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
