P. Zhao

activity

20112013

most citedThe smallest 3-uniform bi-hypergraphs which are one-realization of a given set

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

collaborators

5 papers

math.CO2013

The smallest one-realization of a given set IV

Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang +1

Let $S$ be a finite set of positive integers. A mixed hypergraph $H$ is a one-realization of $S$ if its feasible set is $S$ and each entry of its chromatic spectrum is eithe…

math.CO2012

The smallest one-realization of a given set

Ping Zhao, Kefeng Diao, Kaishun Wang

In [The smallest one-realization of a given set, Electronic J. Combin. 19 (2012), $♯$ P19], we determined the minimum number of vertices of one-realizations of a given finite s…

math.CO2011★ 1 cited

The smallest 3-uniform bi-hypergraphs which are one-realization of a given set

Ping Zhao, Kefeng Diao, Kaishun Wang

For any set $S$ of positive integers, a mixed hypergraph $H$ is a one-realization of $S$ if its feasible set is $S$ and each entry of its chromatic spectrum is either 0 or 1…

math.CO2011

The smallest one-realization of a given set

Ping Zhao, Kefeng Diao, Kaishun Wang

For any set $S$ of positive integers, a mixed hypergraph $H$ is a realization of $S$ if its feasible set is $S$ , furthermore, $H$ is a one-realization of $S$ if it is…

math.CO2011

The chromatic spectrum of 3-uniform bi-hypergraphs

Ping Zhao, Kefeng Diao, Kaishun Wang

Let $S = {n_{1}, n_{2}, ..., n_{t}}$ be a finite set of positive integers with $min (S) \geq 3$ and $t \geq 2$ . For any positive integers $s_{1}, s_{2}, ..., s_{t}$ , we construct a family of 3-uniform…