Rose McCarty

United States

Research Interests

Explore related searches

Contact this professor

Get a free first email built on one of their papers, ready for you to edit and send yourself.

Articles (7)

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 by a function of the treewidth of . We prove that this is false, even when has treewidth 2 and is allowed to be a minor of .

Year:

2024

Year:

2023

Year:

2021

Year:

2021

Year:

2021

Year:

2021

Year:

2020

Collaborators (1)

Freddie Illingworth

University of Oxford

UNITED KINGDOM

View details

ApplyKite TwinLearns as you apply

Make your next move.

Prepare your application

Review drafts before you send them.

Rose McCarty

Research Interests

Explore related searches

Contact this professor

Articles (7)

On tree decompositions whose trees are minors

The Grid Theorem for vertex-minors

Obstructions for bounded shrub-depth and rank-depth

Dense Induced Subgraphs of Dense Bipartite Graphs

Sublinear Separators in Intersection Graphs of Convex Shapes

Circle graphs are quadratically χ-bounded

7-Connected graphs are 4-ordered

Collaborators (1)

Freddie Illingworth

Make your next move.