Paper Info
Title
A note on maximal triangle-free graphs
Abstract
We show that a maximal triangle-free graph on n vertices with minimum degree delta contains an independent set of 3delta - n vertices which have identical neighborhoods. This yields a simple proof that if the binding number of a graph is at least 3/2 then it has a triangle. This was conjectured originally by Woodall. (C) 1993 John Wiley & Sons, Inc.
Year
DOI
Venue
1993
10.1002/jgt.3190170510
Journal of Graph Theory
Keywords
DocType
Volume
maximal triangle-free graph
Journal
17
Issue
ISSN
Citations 
5
0364-9024
6
PageRank 
References 
Authors
0.87
0
2
Name
Order
Citations
PageRank
Wayne Goddard111515.40
Daniel J. Kleitman2854277.98