Qinghou Zeng

activity

20202026

collaborators

11 papers

math.CO2026

Intersections of Directed Graphs

Zhanping Yang, Qinghou Zeng

Given two weighted directed graphs of order $n$, we study how much their overlap can deviate from its random average under relabelling, and how concentrated the distribution of t…

math.CO2026

Sharp Bisection Bounds for Digraphs

Zhaoyang Ma, Shufei Wu, Qinghou Zeng

Fix an integer $d \geq 1$ . We prove that, for all sufficiently large $m$ , every digraph $D$ with $m$ arcs and minimum semidegree at least $d$ admits a bisection $V (D) = V_{1} \cup V_{2}$ wit…

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.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…

math.CO2025

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 a…

math.CO2023

Counting triangles in graphs without vertex disjoint odd cycles

Jianfeng Hou, Caihong Yang, Qinghou Zeng

Given two graphs $H$ and $F$ , the maximum possible number of copies of $H$ in an $F$ -free graph on $n$ vertices is denoted by $ex (n, H, F)$ . Let $(ℓ + 1) \cdot F$ denote…