Pith. sign in

REVIEW 1 cited by

Colour-bias perfect matchings in hypergraphs

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 2408.11016 v2 pith:FFUBUSH4 submitted 2024-08-20 math.CO

Hiêp Hàn , Richard Lang , João Pedro Marciano , Matías Pavez-Signé , Nicolás Sanhueza-Matamala , Andrew Treglown , Camila Zárate-Guerén This is my paper · ORCID
classification math.CO
keywords conditionsmatchingsperfectunderanswersarate-guerbaloghcolour-bias
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study conditions under which an edge-coloured hypergraph has a particular substructure that contains more than the trivially guaranteed number of monochromatic edges. Our main result solves this problem for perfect matchings under minimum degree conditions. This answers recent questions of Gishboliner, Glock and Sgueglia, and of Balogh, Treglown and Z\'arate-Guer\'en.

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. Colour-biased Hamilton cycles in randomly perturbed graphs

    math.CO 2025-06 reject novelty 7.0 of 10

    Randomly perturbing a graph with O(n) random edges forces a colour-biased Hamilton cycle, and at the critical minimum degree the bias is proportional to m.

Pith tools