Marcin Pilipczuk

most citedFinding large induced sparse subgraphs in

C_{> t}

-free graphs in quasipolynomial time

6 citations · 8 across the 2 of their papers we have counts for

collaborators

2 papers

cs.DS2020★ 6 cited

Finding large induced sparse subgraphs in $C_{> t}$ -free graphs in quasipolynomial time

Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk +2

For an integer $t$ , a graph $G$ is called {\em{ $C_{> t}$ -free}} if $G$ does not contain any induced cycle on more than~ $t$ vertices. We prove the following statement: for every pair…

math.CO2019★ 2 cited

Jones' Conjecture in subcubic graphs

Marthe Bonamy, François Dross, Tomáš Masařík +3

We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain $k + 1$ vertex-disjoint cycles, then it suffices to delete $2 k$ vertices to obta…

Finding large induced sparse subgraphs in C>t​-free graphs in quasipolynomial time

Jones' Conjecture in subcubic graphs

Finding large induced sparse subgraphs in $C_{> t}$ -free graphs in quasipolynomial time