The chromatic spectrum of 3-uniform bi-hypergraphs

Details The chromatic spectrum of 3-uniform bi-hypergraphs The chromatic spectrum of 3-uniform bi-hypergraphs

2011-05-13

arxiv.org/abs/1105.2672v1

Mathematics

Combinatorics

Scientific paper

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 bi-hypergraphs ${\cal H}$ with the feasible set $S$ and $r_{n_i}=s_i, i=1,2,...,t$, where each $r_{n_i}$ is the $n_i$th component of the chromatic spectrum of ${\cal H}$. As a result, we solve one open problem for 3-uniform bi-hypergraphs proposed by Bujt\'{a}s and Tuza in 2008. Moreover, we find a family of sub-hypergraphs with the same feasible set and the same chromatic spectrum as it's own. In particular, we obtain a small upper bound on the minimum number of vertices in 3-uniform bi-hypergraphs with any given feasible set.

Affiliated with

Also associated with

No associations

Rating

The chromatic spectrum of 3-uniform bi-hypergraphs 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 chromatic spectrum of 3-uniform bi-hypergraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The chromatic spectrum of 3-uniform bi-hypergraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-27041