Stable formulas in ordered structures
Hoffmann, D
Tran, C
Ye, J
(23 Apr 2020)
http://arxiv.org/abs/2004.10953v2
Éz fields
Walsberg, E
Ye, J
(11 Mar 2021)
http://arxiv.org/abs/2103.06919v4
The étale open topology over the fraction field of a henselian local
domain
Johnson, W
Walsberg, E
Ye, J
(04 Aug 2021)
http://arxiv.org/abs/2108.01868v2
domain
Beautiful pairs
Kovacsics, P
Hils, M
Ye, J
(01 Dec 2021)
http://arxiv.org/abs/2112.00651v3
An invitation to extension domination
Gannon, K
Ye, J
(17 Jul 2022)
http://arxiv.org/abs/2207.08238v2
A note on $μ$-stabilizers in ACVF
Ye, J
(07 Oct 2019)
http://arxiv.org/abs/1910.02888v3
A note on geometric theories of fields
Johnson, W
Ye, J
(01 Aug 2022)
http://arxiv.org/abs/2208.00586v3
When is the étale open topology a field topology?
Dittmann, P
Walsberg, E
Ye, J
(04 Aug 2022)
http://arxiv.org/abs/2208.02398v4
Curve-excluding fields
Johnson, W
Ye, J
(10 Mar 2023)
http://arxiv.org/abs/2303.06063v2
Tue, 25 Apr 2023
14:00 -
15:00
L5
Pancyclicity of highly-connected graphs
Shoham Letzter
(University College London)
Abstract
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 a similar result, implying 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.