Miao Fu

most citedLower Bound on Translative Covering Density of Tetrahedra

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

collaborators

7 papers

math.MG2023

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…

math.CO2022

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 $C$ be an $n$ -dimensional unit cube and let $H$ be a plank of thickness $1$ , both are center…

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.MG2022★ 2 cited

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…

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.MG2022

Lower Bounds on Lattice Covering Densities of Simplices

Miao Fu, Fei Xue, Chuanming Zong

This paper presents new lower bounds for the lattice covering densities of simplices by studying the Degree-Diameter Problem for abelian Cayley digraphs. In particular, it proves t…