Yuqin Zhang

most citedOn Hadwiger's covering functional for the simplex and the cross-polytope

2 citations · 3 across the 5 of their papers we have counts for

collaborators

6 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

Monochromatic vertex-disconnection of graphs

Miao Fu, Yuqin Zhang

Let G be a vertex-colored graph. A vertex cut S of G is called a monochromatic vertex cut if the vertices of S are colored with the same color. A graph G is monochromatically verte…

math.MG2021

A note on the maximal perimeter and maximal width of a convex small polygon

Fei Xue, Yanlu Lian, Jun Wang +1

The polygon $P$ is small if its diameter equals one. When $n = 2^{s}$ , it is still an open problem to find the maximum perimeter or the maximum width of a small $n$ -gon. Motivated by B…

math.MG2021★ 2 cited

On Hadwiger's covering functional for the simplex and the cross-polytope

Fei Xue, Yanlu Lian, Yuqin Zhang

In 1957, Hadwiger made a conjecture that every $n$ -dimensional convex body can be covered by $2^{n}$ translations of its interior. The Hadwiger's covering functional $γ_{m} (K)$ is the…

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\…

math.MG2021★ 1 cited

Covering the crosspolytope with its smaller homothetic copies

Yanlu Lian, Yuqin zhang

In 1957, Hadwiger made the famous conjecture that any convex body of $n$ -dimensional Euclidean space $E^{n}$ can be covered by $2^{n}$ smaller positive homothetic copies. Up t…