REVIEW 2 cited by
The optimal edge-colouring threshold
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
read the original abstract
Consider any dense r-regular quasirandom bipartite graph H with parts of size n and fix a set of r colours. Let L be a random list assignment where each colour is available for each edge of H with probability p. We show that the threshold probability for H to have a proper L-edge-colouring is p of order (log n)/n. This answers a question of Kang, Kelly, K\"uhn, Methuku and Osthus. We thus obtain the same threshold for Steiner Triple Systems and Latin squares; the latter answers a question of Johanssen from 2006.
Forward citations
Cited by 2 Pith papers
-
Universality in random graphs via optimal linking systems: trees and beyond
An absolute constant C suffices for bounded-degree tree universality in G(n, C ln n/n), and cycle-factor universality is optimal up to constants via depth-optimal linking systems.
-
No-$(k+1)$-in-line problem for $k \geqslant 3$
For k≥3 and sufficiently large n, the maximum number of points in an n×n grid with no k+1 collinear is exactly kn.
Discussion (0). Sign in to comment.