Tianyun Tang

collaborators

2 papers

math.CO2020

Minimizing cycles in tournaments and normalized $q$ -norms

Jie Ma, Tianyun Tang

Akin to the Erdős-Rademacher problem, Linial and Morgenstern made the following conjecture in tournaments: for any $d \in (0, 1]$ , among all $n$ -vertex tournaments with $d\binom{n}{3…

math.CO2019

Monochromatic subgraphs in iterated triangulations

Jie Ma, Tianyun Tang, Xingxing Yu

For integers $n \geq 0$ , an iterated triangulation $T r (n)$ is defined recursively as follows: $T r (0)$ is the plane triangulation on three vertices and, for $n \geq 1$ , $T r (n)$ is the p…

Minimizing cycles in tournaments and normalized q-norms

Monochromatic subgraphs in iterated triangulations

Minimizing cycles in tournaments and normalized $q$ -norms