Jun Wang

collaborators

2 papers

math.CO2022

New sufficient degree conditions for an $r$ -uniform hypergraph to be $k$ -edge-connected

Jiyun Guo, Jun Wang, Zhanyuan Cai +1

An $r$ -uniform hypergraphic sequence (i.e., $r$ -graphic sequence) $d = (d_{1}, d_{2}, \dots, d_{n})$ is said to be forcibly $k$ -edge-connected if every realization of $d$ is $k$ -edge-connec…

math.CO2022

Some criteria for integer sequences pair being realizable by a graph

Jiyun Guo, Miao Fu, Jun Wang

Let $A = (a_{1}, \dots, a_{n})$ and $B = (b_{1}, \dots, b_{n})$ be two sequences of nonnegative integers with $a_{i} \leq b_{i}$ for $1 \leq i \leq n$ . The pair $(A; B)$ is said to be realizable by a grap…

New sufficient degree conditions for an r-uniform hypergraph to be k-edge-connected

Some criteria for integer sequences pair being realizable by a graph

New sufficient degree conditions for an $r$ -uniform hypergraph to be $k$ -edge-connected