2 papers
math.CO2023
On tree decompositions whose trees are minors
Pablo Blanco, Linda Cook, Meike Hatzel +3
In 2019, Dvořák asked whether every connected graph has a tree decomposition so that is a subgraph of and the width of is bounded…
math.CO2022
Towards the Erdős-Hajnal conjecture for -free graphs
Pablo Blanco, Matija Bucić
The Erdős-Hajnal conjecture is one of the most classical and well-known problems in extremal and structural combinatorics dating back to 1977. It asserts that in stark contrast to…