3 papers
math.CO2020
Flow Extensions and Group Connectivity with Applications
Jiaao Li
We study the flow extension of graphs, i.e., pre-assigning a partial flow on the edges incident to a given vertex and aiming to extend to the entire graph. This is closely related…
math.CO2020
On -flow-critical graphs
Jiaao Li, Yulai Ma, Yongtang Shi +2
A bridgeless graph is called -flow-critical if it does not admit a nowhere-zero -flow, but has for any . Tutte's -flow conjecture can be equivalently…
math.CO2019
Anti-Ramsey numbers of paths and cycles in hypergraphs
Ran Gu, Jiaao Li, Yongtang Shi
The anti-Ramsey problem was introduced by Erdős, Simonovits and Sós in 1970s. The anti-Ramsey number of a hypergraph , , is the smallest integer…