2000 character limit reached
The independence ratio of 4-cycle-free planar graphs
Published 3 May 2023 in math.CO and cs.DM | (2305.02414v1)
Abstract: We prove that every $n$-vertex planar graph $G$ with no triangle sharing an edge with a 4-cycle has independence ratio $n/\alpha(G) \leq 4 - \varepsilon$ for $\varepsilon = 1/30$. 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 $\varepsilon = 2/9$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.