ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d>1/2d>1/2, let GdG_d be a dndn-regular graph on nn vertices, and let G(n,p)G(n,p) be the binomial random graph. A triangle packing is a collection of edge-disjoint triangles; it covers all but o(n2)o(n^2) edges if the number of uncovered edges is o(n2)o(n^2) as n→∞n\rightarrow\infty.

Near-perfect packing conjecture. If

p>(3−4d)/(4−4d),p>(3-4d)/(4-4d),

then with high probability there exists a triangle packing in Gd∪G(n,p)G_d\cup G(n,p) that covers all but o(n2)o(n^2) edges.

This conjecture is proposed as the tightness of the paper's lower bound for pdp_d in the regime d>1/2d>1/2, without assuming the Nash-Williams conjecture. Its resolution is not supplied, so it remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.