Jianfeng Hou

activity

20132023

collaborators

Showing math.COShow all

5 papers · 1 filter

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…

math.CO2022

Extremal graphs for the suspension of edge-critical graphs

Jianfeng Hou, Heng Li, Qinghou Zeng

The Turán number of a graph $H$ , $ex (n, H)$ , is the maximum number of edges in an $n$ -vertex graph that does not contain $H$ as a subgraph. For a vertex $v$ and a multi-set $…

math.CO2022

Two stability theorems for $K_{ℓ + 1}^{r}$ -saturated hypergraphs

Jianfeng Hou, Heng Li, Caihong Yang +2

An $F$ -saturated $r$ -graph is a maximal $r$ -graph not containing any member of $F$ as a subgraph. Let $K_{ℓ + 1}^{r}$ be the collection of all $r$ -…

math.CO2018

A bound on judicious bipartitions of directed graphs

Jianfeng Hou, Huawen Ma, Xingxing Yu +1

Judicious partitioning problems on graphs ask for partitions that bound several quantities simultaneously, which have received a lot of attentions lately. Scott asked the following…

math.CO2013

On total colorings of 1-planar graphs

Xin Zhang, Jianfeng Hou, Guizhen Liu

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar gra…

MaxCut in graphs with sparse neighborhoods

Extremal graphs for the suspension of edge-critical graphs

Two stability theorems for Kℓ+1r​-saturated hypergraphs

A bound on judicious bipartitions of directed graphs

On total colorings of 1-planar graphs

Two stability theorems for $K_{ℓ + 1}^{r}$ -saturated hypergraphs