On the Erdős-Pósa property for long holes in C_4-free graphs

05/25/2021
by   Tony Huynh, et al.
0

We prove that there exists a function f(k)=𝒪(k^2 log k) such that for every C_4-free graph G and every k ∈ℕ, G either contains k vertex-disjoint holes of length at least 6, or a set X of at most f(k) vertices such that G-X has no hole of length at least 6. This answers a question of Kim and Kwon [Erdős-Pósa property of chordless cycles and its applications. JCTB 2020].

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/02/2017

Erdős-Pósa property of chordless cycles and its applications

A chordless cycle in a graph G is an induced subgraph of G which is a cy...
research
12/17/2019

Erdős-Pósa from ball packing

A classic theorem of Erdős and Pósa (1965) states that every graph has e...
research
03/20/2018

Packing and covering induced subdivisions

A graph class F has the induced Erdős-Pósa property if there exists a fu...
research
01/30/2019

On properties of B-terms

B-terms are built from the B combinator alone defined by B≡λ f.λ g.λ x. ...
research
05/05/2021

2× n Grids have Unbounded Anagram-Free Chromatic Number

We show that anagram-free vertex colouring a 2× n square grid requires a...
research
03/14/2018

H-colouring P_t-free graphs in subexponential time

A graph is called P_t-free if it does not contain the path on t vertices...
research
11/25/2021

The Implicit Graph Conjecture is False

An efficient implicit representation of an n-vertex graph G in a family ...

Please sign up or login with your details

Forgot password? Click here to reset