Showing math.COShow all
4 papers · 1 filter
math.CO2026
A sharp asymptotic bound for odd cycles in planar graphs
Zhen Liu, Chuanshu Wu
For graphs and , let denote the number of unlabeled, not necessarily induced copies of in , and let be the maximum of $…
math.CO2026
A subquadratic bound for generalized Turán numbers of odd cycles
Zhen Liu, Chuanshu Wu
For a graph and a family of graphs , let denote the maximum number of copies of in an -free graph on vertices. For e…
math.CO2026
The maximum number of paths of even length in a planar graph
Zhen Liu, Chuanshu Wu
For graphs \(G\) and \(H\), let \(N(G,H)\) be the number of unlabeled, not necessarily induced copies of \(H\) in \(G\), and let \(f(n,H)\) be the maximum of \(N(G,H)\) over all \(…
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…