ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let FF be a graph and α>1\alpha>1 be such that ex⁡(n,F)=Ω(nα\operatorname{ex}(n,F)=\Omega(n^{\alpha}). Then for any ϵ>0\epsilon > 0 there is n0n_0 so that if n>n0n > n_0 and a graph HH is the edge-disjoint union of m=⌈ϵnα⌉m=\lceil \epsilon n^{\alpha}\rceil copies of FF, then HH contains another copy of FF (i.e.\ has at least m+1m+1 copies of FF).

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.