ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let (V1,…,Vq)(V_1,\ldots,V_q) be a balanced qq-partition of a qq-partite graph GG, with ∣Vi∣=n|V_i|=n for every ii. Define

δ^(G):=min⁡{d(v,Vj):1≤j≤q, v∈V(G)∖Vj}.\hat{\delta}(G):=\min\{d(v,V_j):1\leq j\leq q,\ v\in V(G)\setminus V_j\}.

Call GG partite-KqK_q-divisible when, for every 1≤j1<j2≤q1\leq j_1<j_2\leq q and every v∈V(G)∖(Vj1∪Vj2)v\in V(G)\setminus(V_{j_1}\cup V_{j_2}), one has d(v,Vj1)=d(v,Vj2)d(v,V_{j_1})=d(v,V_{j_2}).

Partite folklore conjecture. For each integer q≥4q\geq 4, the following holds for sufficiently large nn: if GG is a balanced partite-KqK_q-divisible qq-partite graph on qnqn vertices with

δ^(G)≥(1−1q+1)n,\hat{\delta}(G)\geq \left(1-\frac{1}{q+1}\right)n,

then GG admits a KqK_q-decomposition.

This is the partite counterpart of the folklore high-minimum-degree conjecture for KqK_q-decompositions and is connected to the existence of mutually orthogonal Latin squares. The source presents it as 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.