ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a graph with chromatic number at least 33. For an nn-vertex graph GG, let ϕ(G,H)\phi(G,H) be the minimum number of parts in an edge partition into copies of HH and single edges, and define ϕ(n,H):=max⁡G∈Gnϕ(G,H)\phi(n,H):=\max_{G\in\mathcal{G}_n}\phi(G,H). Let ex⁡(n,H)\operatorname{ex}(n,H) denote the maximum number of edges in an nn-vertex graph containing no copy of HH.

Pikhurko–Sousa conjecture. There is an integer n0=n0(H)n_0=n_0(H) such that

ϕ(n,H)=ex⁡(n,H)\phi(n,H)=\operatorname{ex}(n,H)

for every n≥n0n\geq n_0.

Pikhurko and Sousa had previously established the asymptotic relation ϕ(n,H)=ex⁡(n,H)+o(n2)\phi(n,H)=\operatorname{ex}(n,H)+o(n^2) for each fixed graph HH with chromatic number at least 33; the conjecture asks for eventual exact equality.

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.