ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let kk and mm be positive integers. A graph is kk-connected when its connectivity number is at least kk, and f(G)f(G) denotes the minimum degree of GG.

Fujita–Kawarabayashi conjecture. There is a least non-negative integer fk(m)f_k(m) such that every kk-connected graph GG satisfying

f(G)≥⌊3k2⌋+fk(m)−1f(G)\geq\left\lfloor\frac{3k}{2}\right\rfloor+f_k(m)-1

contains a connected subgraph WW of order mm for which G−V(W)G-V(W) is still kk-connected.

The conjecture generalizes results guaranteeing the deletion of one vertex or one edge while preserving kk-connectivity. The supplied text gives no resolution status, so the conjecture is recorded 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.