On the Structure of a Triangle-Free Infinite-Chromatic Graph of Gyarfas
Larry Eggan1,2and Frank Harary3,4
Received22 Jun 1981
Revised13 Sept 1982
Abstract
Gyárfás has recently constructed an elegant new example of a triangle-free infinite graph G with infinite chromatic number. We analyze its structure by studying the properties of a nested family of subgraphs Gn whose union is G.