Triangle-free planar graphs with the smallest independence number

From MaRDI portal
Publication:4630003




Abstract: Steinberg and Tovey proved that every n-vertex planar triangle-free graph has an independent set of size at least (n+1)/3, and described an infinite class of tight examples. We show that all n-vertex planar triangle-free graphs except for this one infinite class have independent sets of size at least (n+2)/3.









This page was built for publication: Triangle-free planar graphs with the smallest independence number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630003)