Counterexamples to Clique Immersion Conjecture for Direct Products
Combinatorics
2026-05-29 v2
Abstract
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.
Cite
@article{arxiv.2605.28518,
title = {Counterexamples to Clique Immersion Conjecture for Direct Products},
author = {Chuanshu Wu and Zijian Deng},
journal= {arXiv preprint arXiv:2605.28518},
year = {2026}
}