A new proof of the independence ratio of triangle-free cubic graphs (Q5936033)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new proof of the independence ratio of triangle-free cubic graphs |
scientific article; zbMATH DE number 1612893
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new proof of the independence ratio of triangle-free cubic graphs |
scientific article; zbMATH DE number 1612893 |
Statements
A new proof of the independence ratio of triangle-free cubic graphs (English)
0 references
29 March 2002
0 references
It is known that every triangle-free graph of order \(n\) and of maximum degree 3 has independence number at least \(5n/14.\) In the paper a new, simpler proof of the statement is provided.
0 references
independent set
0 references
triangle-free graph
0 references
0.91554165
0 references
0 references
0.9101923
0 references
0.90991336
0 references
0.9054297
0 references
0.90480745
0 references
