A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Note
2003
Combinatorica
In this note, a structural result for maximal Kr-free graphs is proven, which provides a simple proof of the Andrásfai-Erdős-Sós Theorem, saying that every Kr-free graph with minimum degree δ > (1 − 1 r− 4 3 )n is (r − 1)-colourable.
doi:10.1007/s00493-003-0042-z
fatcat:byez4hglkbgatlk64go7wi7v3q