The independence ratio of 4-cycle-free planar graphs

05/03/2023
by   Tom Kelly, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/30/2019

Homothetic triangle representations of planar graphs

We prove that every planar graph is the intersection graph of homothetic...
research
12/24/2018

Planar graphs without pairwise adjacent 3-,4-,5-, and 6-cycle are 4-choosable

Xu and Wu proved that if every 5-cycle of a planar graph G is not simult...
research
06/08/2023

Colouring planar graphs with a precoloured induced cycle

Let C be a cycle and f : V(C) →{c_1,c_2,…,c_k} a proper k-colouring of C...
research
12/08/2022

Triangle-free projective-planar graphs with diameter two: domination and characterization

In 1975, Plesník characterized all triangle-free planar graphs as having...
research
11/16/2017

Packing nearly optimal Ramsey R(3,t) graphs

In 1995 Kim famously proved the Ramsey bound R(3,t) > c t^2/ t by constr...
research
07/16/2021

On Vizing's edge colouring question

Soon after his 1964 seminal paper on edge colouring, Vizing asked the fo...
research
06/29/2023

Planar splines on a triangulation with a single totally interior edge

We derive an explicit formula, valid for all integers r,d≥ 0, for the di...

Please sign up or login with your details

Forgot password? Click here to reset