Li's conjecture on generalized connectivity of complete multipartite graphs
Li's conjecture on generalized connectivity of complete multipartite graphs
Let be a complete multipartite graph, let be a positive integer, and let be a -subset of . Li's conjecture. We have when the numbers of vertices in the parts of that are not in are almost the same. The conjecture generalizes the preceding complete equipartite formulation; the supplied text gives no resolution status.
Sources & referencesView supporting material
Primary source
Xueliang Li and Yaping Mao, “A survey on the generalized connectivity of graphs”, arXiv:1207.1838 (2015).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.