/-
Copyright 2026 The Formal Conjectures Authors.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
https://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
-/modulepublicimportFormalConjecturesUtil
[EHS74] Erdős, P. and Hajnal, A. and Shelah, S., On some general properties of chromatic
numbers. Topics in topology (Proc. Colloq., Keszthely, 1972) (1974), 243-255.
[Th83] Thomassen, Carsten, Cycles in graphs of uncountable chromatic number. Combinatorica
(1983), 133-134.
@[expose]publicsectionnamespaceErdos737
G has chromatic number exactly $\aleph_1$: it has a proper colouring by the countable ordinals
(a set of cardinality $\aleph_1$) but no proper colouring by ℕ.
Let $G$ be a graph with chromatic number $\aleph_1$. Must there exist an edge $e$ such that, for
all large $n$, $G$ contains a cycle of length $n$ containing $e$?
The answer is yes, proved by Thomassen [Th83]. Erdős, Hajnal, and Shelah [EHS74] proved that $G$
must contain all sufficiently large cycles (see Erdős Problem 594).
The title and abstract of [Th83] state the result for graphs of uncountable chromatic number,
that is, graphs with no proper colouring by ℕ. This is stronger than erdos_737.