ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn, let k≥3k\geq 3 be an integer, and let n1,…,nkn_{1},\dots,n_{k} be positive integers satisfying

∑i=1kni=n.\sum_{i=1}^{k}n_i=n.

Write σ2(G)\sigma_2(G) for the minimum degree sum of two nonadjacent vertices. Enomoto and Ota's conjecture. If

σ2(G)≥n+k−1,\sigma_2(G)\geq n+k-1,

then for any kk distinct vertices x1,…,xkx_1,\dots,x_k in GG, there exist vertex-disjoint paths P1,…,PkP_1,\dots,P_k such that ∣Pi∣=ni|P_i|=n_i and PiP_i starts at xix_i for every 1≤i≤k1\leq i\leq k. The conjecture predicts a prescribed path partition of the entire vertex set under a degree-sum condition; the paper proves it when the order of GG is sufficiently large, while the remaining cases are not addressed here.

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.