3 papers
math.CO2026
Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
Peiru Kuang, Yan Wang
An edge-colored graph is said to be rainbow if all its edges have distinct colors. In this paper, we study the rainbow analogue of a fundamental result of Mader [\emph{Math. Ann.}…
math.CO2025
Tight bounds for judicious 3-partitions of graphs
Peiru Kuang, Yan Wang
In this paper, we show that every graph with edges admits a 3-partition such that \[ \max_{1 \leq i \leq 3} e(V_i) \leq \frac{m}{9} + \frac{1}{9}h(m) \quad \text{and} \quad e(V…
math.CO2025
Consecutive and quasi-consecutive patterns: -Wilf classifications and generating functions
Yan Wang, Qi Fang, Shishuo Fu +2
Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as e…