3 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 -regular graph with vertices, there exists a spanning subgraph such that for all , we have ,…
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…
cs.LO2023
A separation logic for sequences in pointer programs and its decidability
Tianyue Cao, Bowen Zhang, Zhao Jin +2
Separation logic and its variants can describe various properties on pointer programs. However, when it comes to properties on sequences, one may find it hard to formalize. To deal…