REVIEW 1 cited by
Discrepancies of perfect matchings in hypergraphs
Not yet reviewed by Pith; the record is open.
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
abstract
In this paper, we determine the minimum degree threshold of perfect matchings with high discrepancy in $r$-edge-colored $k$-uniform hypergraphs for all $k\geq 3$ and $r\geq 2$, thereby completing the investigation into discrepancies of perfect matchings that has recently attracted significant attention. Our approach identifies this discrepancy threshold with a novel family of multicolored uniform hypergraphs and reveals new phenomena not covered in previous studies. In particular, our results address a question of Balogh, Treglown and Z\'arate-Guer\'en concerning 3-uniform hypergraphs.
Forward citations
Cited by 1 Pith paper
-
Colour-biased Hamilton cycles in randomly perturbed graphs
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.
Discussion (0). Sign in to comment.