Qinghou Zeng

collaborators

3 papers

math.CO2026

Large odd induced subgraphs via odd cuts

Qinghou Zeng

Gallai proved that every graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We show that if a graph admits a bipartition in which every vertex…

math.CO2026

Graded discrepancy of graphs and hypergraphs

Yanling Chen, Shuping Huang, Qinghou Zeng

This paper studies the following question of BollobÃ¡s and Scott: Let $G$ be a graph with $n$ vertices and $p (2 n)$ edges. What is the smallest $c (p, n)$ such that there is…

math.CO2025

Max-Bisections of graphs without even cycles

Jianfeng Hou, Siwei Lin, Qinghou Zeng

For an integer $k \geq 2$ , let $G$ be a graph with $m$ edges and without cycles of length $2 k$ . The pivotal Alon-Krivelevich-Sudakov Theorem on Max-Cuts states that $G$ has a biparti…