ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Throughout, graphs are finite, simple, and undirected. Let \k\k be a positive integer, and let \T\T be a tree with bipartition (X,Y)(X,Y). A graph is \k\k-connected when its connectivity satisfies κ(G)≥k\kappa(G)\geq k; δ(G)\delta(G) denotes minimum degree, and \G−V(T′)\G-V(T') is the graph obtained by deleting the vertices of \T′\T'.

Luo–Tian–Wu's conjecture. Every \k\k-connected bipartite graph \G\G with

δ(G)≥k+max⁡{∣X∣,∣Y∣}\delta(G)\geq k+\max\{|X|,|Y|\}

contains a subtree \T′≅T\T'\cong T such that

κ(G−V(T′))≥k.\kappa(G-V(T'))\geq k.

This is the bipartite analogue of Mader's connectivity-keeping tree conjecture. The conjecture remains open for \k≥4\k\geq 4; the corresponding path result is known under a related minimum-degree condition.

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.