Chuanshu Wu

works on

combinatorial optimization 1 extremal graph theory 1 graph enumeration 1 path counting 1 planar graphs 1

From the 1 of 3 linked papers with an AI index.

collaborators

3 papers

math.CO2026

A sharp asymptotic bound for odd cycles in planar graphs

Zhen Liu, Chuanshu Wu

For graphs $G$ and $H$ , let $N (G, H)$ denote the number of unlabeled, not necessarily induced copies of $H$ in $G$ , and let $N_{P} (n, H)$ be the maximum of…

math.CO2026

The maximum number of paths of even length in a planar graph

Zhen Liu, Chuanshu Wu

The paper proves a conjecture giving the exact leading term for the maximum number of even‑length paths that can appear in an n‑vertex planar graph, and also resolves the Cox–Marti…

math.CO2026

Counterexamples to Clique Immersion Conjecture for Direct Products

Chuanshu Wu, Zijian Deng

Let $G$ and $H$ be graphs, and let $G\times H$ denote their direct product. For a graph $G$, let $\operatorname{im}(G)$ be the largest integer $t$ such that $G$ conta…