Pith. sign in

REVIEW 1 cited by

Treewidth versus clique number: induced minors

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 2410.17979 v1 pith:3QUXTH7C submitted 2024-10-23 math.CO

Claire Hilaire , Martin Milanič , Nicolas Trotignon , Djordje Vasić This is my paper · ORCID
classification math.CO
keywords classboundedgraphsinducedmathsfminorsomegaclique
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

We prove that a hereditary class of graphs is $(\mathsf{tw}, \omega)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, \omega)$-bounded class.

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. Excluding an induced wheel minor in graphs without large induced stars

    math.CO 2025-06 conditional novelty 8.0 of 10

    K_{1,d}-free graphs without an induced wheel minor W_ℓ have tree-independence number bounded by an explicit function of d and ℓ.

Pith tools