Li et al.'s generalized 3-connectivity conjecture for Cartesian product graphs
Statement
Let be a nontrivial connected graph, and let be a -connected graph. The generalized -connectivity of a graph , denoted by , and its vertex-connectivity, denoted by , satisfy the following conjecture. Li et al.'s conjecture. The following assertions hold: (i) if , then
Moreover, the bound is sharp; (ii) if , then
Moreover, the bound is sharp. This conjecture seeks sharp lower bounds for generalized -connectivity under Cartesian products, extending the preceding results for connected and -connected factors.
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.