Pith. sign in

REVIEW 1 cited by

Sidorenko's conjecture for higher tree decompositions

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 1805.02238 v1 pith:PS3FM5WP submitted 2018-05-06 math.CO

David Conlon , Jeong Han Kim , Choongbum Lee , Joonkyung Lee This is my paper
classification math.CO
keywords conjecturesidorenkoadvancesapproachbroaderclasscompanioncomparable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader class, comparable to that given in work of Szegedy, through further iteration.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Sidorenko property and forcing in regular tournaments

    math.CO 2026-02 conditional novelty 7.0 of 10

    For nearly regular tournaments, a tournament has the Sidorenko property exactly when it is transitive or a blow-up of the cyclic triangle whose three parts are transitive.

Pith tools