加载中…
Let and be graphs, and let denote their direct product. For a graph , let be the largest integer such that contains a -immersion. Collins, Heenehan, and McDonald conjectured that if and , then We disprove this conjecture by constructing an infinite family of connected bipartite counterexamples.

生成讲解博客的中文版本

生成AI智能校验的中文版本