Tianyue Cao

collaborators

2 papers

math.CO2026

Irregular subgraph in a regular graph

Tianyue Cao, Quanyu Tang, Hehui Wu

A conjecture of Alon and Wei states that, for any $d$ -regular graph $G$ with $n$ vertices, there exists a spanning subgraph $H$ such that for all $0 \leq i \leq d$ , we have $m (H, i)$ ,…

math.CO2024

Chip games and multipartite graph paintability

Peter Bradshaw, Tianyue Cao, Atlas Chen +6

We study the paintability, an on-line version of choosability, of complete multipartite graphs. We do this by considering an equivalent chip game introduced by Duraj, Gutowski, and…