On the tightness of the 514 independence ratio
From MaRDI portal
Publication:932585
Recommendations
- A new proof of the independence ratio of triangle-free cubic graphs
- scientific article; zbMATH DE number 1151823
- Triangle-free planar graphs with the smallest independence number
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- The fractional chromatic number of triangle-free graphs with \(\varDelta \leq 3\)
Cites work
- 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)
- A new proof of the independence ratio of triangle-free cubic graphs
- Bipartite density and the independence ratio
- scientific article; zbMATH DE number 3664996 (Why is no real title available?)
- scientific article; zbMATH DE number 3536160 (Why is no real title available?)
- scientific article; zbMATH DE number 3637904 (Why is no real title available?)
- scientific article; zbMATH DE number 1151823 (Why is no real title available?)
- Size and independence in triangle‐free graphs with maximum degree three
- Some Ramsey-Type Numbers and the Independence Ratio
Cited in
(8)- Independence number of 2-factor-plus-triangles graphs
- Independent sets and repeated degrees
- Minimum \(k\)-path vertex cover
- On line graphs of subcubic triangle-free graphs
- Triangle packings and transversals of some \(K_{4}\)-free graphs
- Independence, odd girth, and average degree
- Tight Probability Bounds with Pairwise Independence
- The independence number in graphs of maximum degree three
This page was built for publication: On the tightness of the \(\frac {5}{14}\) independence ratio
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q932585)
