Luo–Tian–Wu's bipartite connectivity-keeping tree conjecture
Statement
Throughout, graphs are finite, simple, and undirected. Let be a positive integer, and let be a tree with bipartition . A graph is -connected when its connectivity satisfies ; denotes minimum degree, and is the graph obtained by deleting the vertices of .
Luo–Tian–Wu's conjecture. Every -connected bipartite graph with
contains a subtree such that
This is the bipartite analogue of Mader's connectivity-keeping tree conjecture. The conjecture remains open for ; 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.