ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph of order nn, and let kk be an integer at least 22. A partition P\mathcal{P} of V(G)V(G) is kk-proper if every part P∈PP\in\mathcal{P} induces a kk-connected subgraph of GG, where a graph is kk-connected if it has more than kk vertices and deleting any set of fewer than kk vertices leaves it connected. Write δ(G)\delta(G) for the minimum degree of GG. Borozan et al.'s conjecture. If

δ(G)≥(k−1)n,\delta(G)\geq\sqrt{(k-1)n},

then GG has a kk-proper partition P\mathcal{P} satisfying

∣P∣≤n−k+1δ(G)−k+2.|\mathcal{P}|\leq\frac{n-k+1}{\delta(G)-k+2}.

This would improve the known bound with constant c=2123180c=\frac{2123}{180} in the corresponding minimum-degree theorem, reducing that constant to 11 and sharpening the bound on the number of parts.

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.