Ji-Yuo Guo

collaborators

3 papers

math.CO2022

On the existence of tripartite graphs and n-partite graphs

Jiyun Guo, Miao Fu, Yuqin Zhang +1

The degree sequence of a graph is the sequence of the degrees of its vertices. If $π$ is a degree sequence of a graph $G$ , then $G$ is a realization of $π$ and $G$ realizes $π$ . De…

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…

math.CO2021

Optimal conditions for $(L_{1}; L_{2})$ to be forcibly bigraphic

Jiyun Guo, Yuqin Zhang

Let $L_{1} = ([a_{1}, b_{1}], \dots, [a_{m}, b_{m}])$ and $L_{2} = ([c_{1}, d_{1}], \dots, [c_{n}, d_{n}]$ ) be two sequences of intervals consisting of nonnegative integers with $b_{1} \geq \dots \geq b_{m}$ and $d_1\…

On the existence of tripartite graphs and n-partite graphs

Some criteria for integer sequences pair being realizable by a graph

Optimal conditions for (L1​;L2​) to be forcibly bigraphic

Optimal conditions for $(L_{1}; L_{2})$ to be forcibly bigraphic