Abstract
We answer a question of Erdős [1], [2] by showing that any graph of uncountable chromatic number contains an edge through which there are cycles of all (but finitely many) lengths.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Erdős, Problems and results on finite and infinite graphs, in:Recent Advances in Graph Theory (ed. M. Fiedler), Academia Prague (1975), 249–256.
P. Erdős, On the combinatorical problems which I would most like to see solved,Combinatorica 1 (1981), 25–42.
P. Erdős andA. Hajnal, Some remarks in set theory IX,Michigan Math. J. 11 (1964), 107–127.
P. Erdős andA. Hajnal, On chromatic number of graphs and set systems,Acta Math. Acad. Sci. Hung. 17 (1966), 61–99.
P. Erdős, A. Hajnal andS. Shelah, On some general properties of chromatic numbers,Coll. Math. Soc. J. Bolyai 8,Topics in Topology, North Holland (1972), 243–255.
P. Erdős andR. Rado, A construction of graphs without triangles having preassigned order and chromatic number,J. London Math. Soc. 35 (1960), 445–448.