The independence ratio of 4-cycle-free planar graphs
Combinatorics
2026-03-18 v2 Discrete Mathematics
Abstract
We prove that every -vertex planar graph with no triangle sharing an edge with a 4-cycle has independence ratio for . This result implies that the same bound holds for 4-cycle-free planar graphs and planar graphs with no adjacent triangles and no triangle sharing an edge with a 5-cycle. For the latter case we strengthen the bound to .
Keywords
Cite
@article{arxiv.2305.02414,
title = {The independence ratio of 4-cycle-free planar graphs},
author = {Tom Kelly and Sid Kolichala and Caleb McFarland and Jatong Su},
journal= {arXiv preprint arXiv:2305.02414},
year = {2026}
}
Comments
14 pages, 4 figures