Yueming Zhong

activity

20192026

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

A symmetric chain decomposition of $N (m, n)$ of composition

Yueming Zhong

A poset is called a symmetric chain decomposition if the poset can be expressed as a disjoint union of symmetric chains. For positive integers $m$ and $n$ , let $N (m, n)$ denote the…

math.CO2021

On Magic Distinct Labellings of Simple Graphs

Guoce Xin, Xinyu Xu, Chen Zhang +1

A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v \in V$ , the sum of labels of all edges in…

math.CO2021

Constructing explicit Sperner chain decompositions for $L (3, n)$ and $L (4, n)$ via Greedy Algorithms and chain tableaux

Guoce Xin, Yueming Zhong

Let $L (m, n)$ denote Young's lattice, consisting of all partitions whose Young diagrams are contained within an $m \times n$ rectangle. It is a classical result that the partially or…

A symmetric chain decomposition of N(m,n) of composition

On Magic Distinct Labellings of Simple Graphs

Constructing explicit Sperner chain decompositions for L(3,n) and L(4,n) via Greedy Algorithms and chain tableaux

A symmetric chain decomposition of $N (m, n)$ of composition

Constructing explicit Sperner chain decompositions for $L (3, n)$ and $L (4, n)$ via Greedy Algorithms and chain tableaux