collaborators

7 papers

math.CO2026

New upper bound for multicolor Ramsey numbers

Gang Yang, Yaping Mao

Let denote the diagonal -color graph Ramsey number. We prove that there exist absolute constants such that \[ R_r(k)\le \exp\!\left(-c\frac{k}{r^2\log^4(2r)}\ri…

math.CO2026

Solution to a conjecture of Alon, Dębski, Grytczuk and Przybyło on fixed-cardinality arithmetic progressions

Yaping Mao, Zhao Wang, Meiqin Wei +1

Fix a positive integer , and put . Let be the least integer for which one translate of each of can be placed pairwise disjo…

math.CO2026

A complete solution to the biased Alon-Krivelevich-Spencer-Szabó criterion problem for the discrepancy game

Yaping Mao, Meiqin Wei, Gang Yang

Let \(H=(V,\mathcal E)\) be a finite hypergraph. For positive integers \(p\) and \(q\), the \((p:q)\)-biased discrepancy game on \(H\) is played in complete rounds. In each round,…

math.CO2026

Complete Resolution of the Butler-Costello-Graham Conjecture on Monochromatic Constellations

Gang Yang, Yaping Mao

A constellation pattern is a finite increasing rational sequence \(Q=[0=q_0<q_1<\cdots<q_k=1]\), and a \(Q\)-constellation in \([n]\) is obtained by scaling and translating a ratio…

math.CO2026

On the minimum number of monochromatic solutions to the strict Schur inequality in 2-colored integer intervals with negative left endpoint

Gang Yang, Jinxia Liang, Yaping Mao +2

Kosek, Robertson, Sabo, and Schaal studied the minimum number \(M_k(n)\) of monochromatic solutions to the strict Schur inequality system and in \…

math.CO2026

Boolean lattice without small rainbow subposets

Gyula O. H. Katona, Yaping Mao, Kenta Ozeki +2

A Boolean lattice is the power set of an -element ground set equipped with inclusion relation. For two posets and , we…