Qinghou Zeng

collaborators

2 papers

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…

math.CO2023

MaxCut in graphs with sparse neighborhoods

Jinghua Deng, Jianfeng Hou, Siwei Lin +1

Let $G$ be a graph with $m$ edges and let $mc (G)$ denote the size of a largest cut of $G$ . The difference $mc (G) - m /2$ is called the surplus $sp (G)$ of $G…