The independence ratio of 4-cycle-free planar graphs
Abstract
We prove that every n-vertex planar graph G with no triangle sharing an edge with a 4-cycle has independence ratio n/α(G) ≤ 4 - for = 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 = 2/9.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.