1 citations · 1 across the 19 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2020
Minimizing cycles in tournaments and normalized -norms
Jie Ma, Tianyun Tang
Akin to the Erdős-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any , among all -vertex tournaments with $d\binom{n}{3…
math.CO2019
Monochromatic subgraphs in iterated triangulations
Jie Ma, Tianyun Tang, Xingxing Yu
For integers , an iterated triangulation is defined recursively as follows: is the plane triangulation on three vertices and, for , is the p…