2 citations · 5 across the 11 of their papers we have counts for
11 papers
Lower Bound on Translative Covering Density of Octahedron
Yiming Li, Yanlu Lian, Miao Fu +1
In this paper, we present the first nontrivial lower bound on the translative covering density of octahedron. To this end, we show the lower bound, in any translative covering of o…
Classification and enumeration of lattice polygons in a disc
Qiuyue Liu, Yuqin Zhang, Zhanyuan Cai
In 1980, V. I. Arnold studied the classification problem for convex lattice polygons of given area. Since then, this problem and its analogues have been studied by many authors, in…
On Tomaszewski's Cube Vertices Problem
Yiming Li, Yuqin Zhang, Miao Fu
The following assertion was equivalent to a conjecture proposed by B. Tomaszewski : Let be an -dimensional unit cube and let be a plank of thickness , both are center…
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 , then is a realization of and realizes . De…
Lower Bound on Translative Covering Density of Tetrahedra
Yiming Li, Miao Fu, Yuqin Zhang
In this paper, we present the first nontrivial lower bound on the translative covering density of tetrahedra. To this end, we show the lower bound, in any translative covering of t…
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…
Algorithm for monochromatic vertex-disconnection of graphs
Miao Fu, Yuqin Zhang
Let G be a vertex-colored graph. We call a vertex cut S of G a monochromatic vertex cut if the vertices of S are colored with the same color. The graph G is monochromatically verte…
A note on the maximal perimeter and maximal width of a convex small polygon
Fei Xue, Yanlu Lian, Jun Wang +1
The polygon is small if its diameter equals one. When , it is still an open problem to find the maximum perimeter or the maximum width of a small -gon. Motivated by B…
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 -dimensional convex body can be covered by translations of its interior. The Hadwiger's covering functional is the…
Optimal conditions for to be forcibly bigraphic
Jiyun Guo, Yuqin Zhang
Let and ) be two sequences of intervals consisting of nonnegative integers with and $d_1\…
Covering the crosspolytope with its smaller homothetic copies
Yanlu Lian, Yuqin zhang
In 1957, Hadwiger made the famous conjecture that any convex body of -dimensional Euclidean space can be covered by smaller positive homothetic copies. Up t…