3 papers
math.DG2026
A strict upper volume bound for minimal graphs in the unit ball
Qing Cui
Let be a solution of the minimal surface equation on a domain containing the closed unit ball . A classical calibration argument gives $|Graph…
math.CO2025
Some results on minimum saturated graphs
Chenke Zhang, Qing Cui, Jinze Hu +2
Let be a graph and be a family of graphs. We say a graph is -saturated if does not contain any member in and for any $e\in E(\o…
math.CO2025
The saturation number of W 4
Ning Song, Jinze Hu, Shengjin Ji +1
For a fixed graph , a graph is called -saturated if does not contain as a (not necessarily induced) subgraph, but contains a copy of for any $e\in E(\ov…