A Unified Proof of Conjectures on Cycle Lengths in Graphs
In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain a number of exact and optimal results on cycle lengths in gra...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Oxford University Press
2022
|
| Online Access: | View Fulltext in Publisher |