4 papers · 1 filter
The coarse Erdős-Pósa theorem
Sandra Albrechtsen, Marthe Bonamy, Romain Bourneuf +1
We prove the coarse Erdős-Pósa conjecture of Georgakopoulos and Papasoglu. Informally, any graph either contains many fat cycles that are pairwise far apart, or there is a small nu…
A coarse block-cutvertex tree-decomposition
Sandra Albrechtsen, Agelos Georgakopoulos
We obtain a coarse version of the block-cutvertex tree-decomposition of a connected graph.
A coarse Menger theorem for hyperbolic graphs, finitely presented groups, and more
Sandra Albrechtsen
Menger's theorem is one of the most fundamental results in graph theory. It states that if a graph does not contain disjoint paths between two given sets and of ver…
Small counterexamples to the fat minor conjecture
Sandra Albrechtsen, Marc Distel, Agelos Georgakopoulos
We narrow the gap between the family of graphs that do and the family of graphs that do not satisfy the fat minor conjecture by obtaining much simpler counterexamples than were pre…