The independence ratio of 4-cycle-free planar graphs

Tom Kelly, Sid Kolichala, Caleb McFarland +1

We prove that every $n$-vertex planar graph $G$ with no triangle sharing an edge with a 4-cycle has independence ratio $n/\hat{I}\pm (G)\le 4-\epsilon$ for $\epsilon =1/30$. This…