Discrete MathematicsVolume 91, Issue 2, 28 August 1991, Pages 215-217NoteTriangle-free regular graphsAuthor links open overlay panelA.F. SidorenkoShow moreShareCitehttps://doi.org/10.1016/0012-365X(91)90114-HGet rights and contentUnder an Elsevier user licenseopen archiveAbstractAnswering a problem of Erdős it is proved that for every n ≠ 3, 7, 9 there exists a regular graph on n vertices with no triangles where the independence number is equal to the degree.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1991 Published by Elsevier B.V.
