Pith. sign in

REVIEW 5 cited by

Graph minors and metric spaces

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.07456 v3 pith:WUY5GWMK submitted 2023-05-12 math.CO math.GTmath.MG

Graph minors and metric spaces

Agelos Georgakopoulos , Panos Papasoglu This is my paper
classification math.CO math.GTmath.MG
keywords graphmetrictheoremminoraffirmativelyanalogueanaloguesanswer
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

We present problems and results that combine graph-minors and coarse geometry. For example, we ask whether every geodesic metric space (or graph) without a fat $H$ minor is quasi-isometric to a graph with no $H$ minor, for an arbitrary finite graph $H$. We answer this affirmatively for a few small $H$. We also present a metric analogue of Menger's theorem and Konig's ray theorem. We conjecture metric analogues of the Erdos--Posa Theorem and Halin's grid theorem.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Asymptotic structure. III. Excluding a fat tree

    math.CO 2025-09 conditional novelty 8.0

    Any graph lacking a c-fat tree minor can be quasi-isometrically approximated by a graph with line-width bounded in terms of the tree and c.

  2. Almost planar finitely presented groups

    math.GR 2026-05 unverdicted novelty 7.0

    Finitely presented groups with k-planar Cayley graphs have finite-index subgroups with planar Cayley graphs; k-planar coarsely simply connected quasi-transitive graphs are quasi-isometric to planar graphs.

  3. (Treewidth, Clique)-Boundedness and Poly-logarithmic Tree-Independence

    math.CO 2025-10 unverdicted novelty 7.0

    Proves that (treewidth, clique)-bounded graph classes have poly-logarithmic tree-independence number via independence-containers, a generalization of maximal cliques.

  4. Erd\H{o}s--P\'{o}sa property of cycles that are far apart

    math.CO 2024-12 unverdicted novelty 7.0

    The paper proves an Erdős–Pósa-type theorem for cycles separated by distance d: either k such cycles exist or a bounded-size vertex set whose g(d)-neighborhood deletion yields a forest.

  5. Accessibility, planar graphs, and quasi-isometries

    math.GR 2023-10 unverdicted novelty 7.0

    Connected locally finite quasi-transitive graphs quasi-isometric to planar graphs are accessible, classifying such finitely generated groups as virtually free products of free and surface groups that admit planar Cayl...