Gexin Yu

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2026

A sufficient condition for a hypergraph to have a Berge- $k$ -factor

Yuping Gao, Songling Shan, Gexin Yu

For any graph (hypergraph) $G$ with vertex set $V$ and edge set $E$ , we define its incidence bipartite graph $I (G)$ as the bipartite graph with bipartition $(E, V)$ , wher…

math.CO2024

Cliques in Squares of Graphs with Maximum Average Degree less than 4

Daniel W. Cranston, Gexin Yu

Hocquard, Kim, and Pierron constructed, for every even integer $D \geq 2$ , a 2-degenerate graph $G_{D}$ with maximum degree $D$ such that $I ¨ (G_{D}^{2}) = \frac{5}{2} D$ . We prove for (a) all 2-d…

A sufficient condition for a hypergraph to have a Berge-k-factor

Cliques in Squares of Graphs with Maximum Average Degree less than 4

A sufficient condition for a hypergraph to have a Berge- $k$ -factor