Pith. sign in

REVIEW 1 cited by

K_6 minors in 6-connected graphs of bounded tree-width

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 1203.2171 v2 pith:PRZUSH3D submitted 2012-03-09 math.CO cs.DM

Ken-ichi Kawarabayashi , Serguei Norine , Robin Thomas , Paul Wollan This is my paper · ORCID
classification math.COcs.DM
keywords connectedgraphsboundedgraphholdssufficientlytree-widthconclusion
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We prove that every sufficiently big 6-connected graph of bounded tree-width either has a K_6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jorgensen conjectured that it holds for all 6-connected graphs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. On vertex sets inducing tangles

    math.CO 2024-11 conditional novelty 7.0 of 10

    Every k-tangle in a graph is the lift of a k-tangle in a topological minor of size bounded by a function of k, reducing the vertex-set induction problem to bounded-size graphs.

Pith tools