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

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

2011-11-06

arxiv.org/abs/1111.1368v1

Mathematics

Combinatorics

7 pages

Scientific paper

For any set $S$ of positive integers, a mixed hypergraph ${\cal 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. In this paper, we determine the minimum size of 3-uniform bi-hypergraphs which are one-realizations of a given set $S$. As a result, we partially solve an open problem proposed by Bujt$\acute{\rm a}$s and Tuza in 2008.

Affiliated with

Also associated with

No associations

Rating

The smallest 3-uniform bi-hypergraphs which are one-realization of a given set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The smallest 3-uniform bi-hypergraphs which are one-realization of a given set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The smallest 3-uniform bi-hypergraphs which are one-realization of a given set will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-704249