3 papers
math.CO2026
Homomorphism counting for immersion-closed classes is not isomorphism
Andrea Jiménez, Benjamin Moore, Daniel A. Quiroz +1
Lovász proved that two graphs and are isomorphic if for all graphs , where denotes the number of homomorphisms from to $G_2…
math.CO2025
Tree-width of a graph excluding an apex-forest or a wheel as a minor
Chun-Hung Liu, Youngho Yoo
The Grid Minor Theorem states that for every planar graph , there exists a smallest integer such that every graph with tree-width at least contains as a minor.…
math.CO2024
Erdős-Pósa property of -paths in unoriented group-labelled graphs
O-joung Kwon, Youngho Yoo
We characterize the obstructions to the Erdős-Pósa property of -paths in unoriented group-labelled graphs. As a result, we prove that for every finite abelian group and for…