Triangle-free planar graphs with small independence number

Zdeněk Dvořák, Jordan Venters

Since planar triangle-free graphs are 3-colourable, such a graph with n vertices has an independent set of size at least n/3. We prove that unless the graph contains a certain obst…