A Characterisation of Graphs Quasi-isometric to $$K_4$$-minor-free Graphs

Abstract We prove that there is a function f such that every graph with no K -fat $$K_4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> </mml:msub> </mml:math> minor is f ( K )-quasi-isometric to a graph with no $$K_4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> </mml:msub> </mml:math> minor. This solves the $$K_4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> </mml:msub> </mml:math> -case of a general conjecture of Georgakopoulos and Papasoglu. Our proof technique also yields a new short proof of the respective $$K_4^-$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msubsup> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> <mml:mo>-</mml:mo> </mml:msubsup> </mml:math> -case, which was first established by Fujiwara and Papasoglu.

Authors

Institutions

Publication Details

Journal
COMBINATORICA
Published
2025-11-07
DOI
https://doi.org/10.1007/s00493-025-00189-5
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Characterisation of Graphs Quasi-isometric to $$K_4$$-minor-free Graphs

Sandra Albrechtsen, Raphael W. Jacobs, Paul Wollan, Paul Knappe
COMBINATORICA
Limits and Structures in Graph Theory
article

A Characterisation of Graphs Quasi-isometric to $$K_4$$-minor-free Graphs

Sandra Albrechtsen, Raphael W. Jacobs, Paul Wollan, Paul Knappe
article en

Abstract

Abstract We prove that there is a function f such that every graph with no K -fat $$K_4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> </mml:msub> </mml:math> minor is f ( K )-quasi-isometric to a graph with no $$K_4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> </mml:msub> </mml:math> minor. This solves the $$K_4$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> </mml:msub> </mml:math> -case of a general conjecture of Georgakopoulos and Papasoglu. Our proof technique also yields a new short proof of the respective $$K_4^-$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msubsup> <mml:mi>K</mml:mi> <mml:mn>4</mml:mn> <mml:mo>-</mml:mo> </mml:msubsup> </mml:math> -case, which was first established by Fujiwara and Papasoglu.

COMBINATORICAVol. 45(6)
Universität Hamburg (DE), Sapienza University of Rome (IT)
Studienstiftung des Deutschen Volkes
Openalex Percentile: Top 60%
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.