Xiaofeng Gu

activity

20142022

most citedA proof of Brouwer's toughness conjecture

22 citations · 40 across the 13 of their papers we have counts for

collaborators

Showing 2022Show all

4 papers · 1 filter

math.CO2022

Spanning tree packing and 2-essential edge-connectivity

Xiaofeng Gu, Runrun Liu, Gexin Yu

An edge (vertex) cut $X$ of $G$ is $r$ -essential if $G - X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$ -essentially $k$ -edge-connected (resp. $k$ -conn…

math.CO2022

Spectral radius and edge-disjoint spanning trees

Dandan Fan, Xiaofeng Gu, Huiqiu Lin

The spanning tree packing number of a graph $G$ , denoted by $τ (G)$ , is the maximum number of edge-disjoint spanning trees contained in $G$ . The study of $τ (G)$ is one of the classi…

math.CO2022★ 1 cited

Graph rigidity properties of Ramanujan graphs

Sebastian M. Cioabă, Sean Dewar, Georg Grasegger +1

A recent result of Cioabă, Dewar and Gu implies that any $k$ -regular Ramanujan graph with $k \geq 8$ is globally rigid in $R^{2}$ . In this paper, we extend these results and…

math.CO2022

A unified combinatorial view beyond some spectral properties

Xiaofeng Gu, Muhuo Liu

Let $β > 0$ . Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ ver…