ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For integers nn, kk, and ss, let H(n,k,q)H(n,k,q) be the graph construction defined above, and for s≥2s\geq 2 write

hs(n,k,q):=N(Ks,H(n,k,q)).h_s(n,k,q):=N\bigl(K_s,H(n,k,q)\bigr).

Let ex⁡(n,Ks,kP3)\operatorname{ex}(n,K_s,kP_3) denote the maximum number of copies of KsK_s in an nn-vertex graph containing no kk vertex-disjoint copies of the path P3P_3.

Chen–Yang–Yuan–Zhang conjecture. For n≥3kn\geq 3k and s≥3s\geq 3,

ex⁡(n,Ks,kP3)=max⁡{hs(n,k,0),hs(n,k,k−1)}.\operatorname{ex}(n,K_s,kP_3)=\max\{h_s(n,k,0),h_s(n,k,k-1)\}.

Moreover, if 3≤s≤3k−13\leq s\leq 3k-1, then every extremal graph GG satisfies either

G⊆H(n,k,k−1),G\subseteq H(n,k,k-1),

or

K3k−1∪In−3k+1⊆G⊆H(n,k,0).K_{3k-1}\cup I_{n-3k+1}\subseteq G\subseteq H(n,k,0).

This generalizes the known exact edge-counting result for P3P_3-packings to clique counts. The conjecture compares the two constructions that are extremal when s=2s=2; the asserted characterization further restricts all extremal graphs for 3≤s≤3k−13\leq s\leq 3k-1.

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.