The chromatic spectrum of 3-uniform bi-hypergraphs

DOI10.1016/J.DISC.2011.08.007zbMATH Open1238.05102arXiv1105.2672OpenAlexW2023390895MaRDI QIDQ409398FDOQ409398

Ping Zhao, Kaishun Wang, Kefeng Diao

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $S=n_1,n_2,\mathrm{...},n_t$ be a finite set of positive integers with $min(S)geq3$ and $tgeq2$. For any positive integers $s_1,s_2,\mathrm{...},s_t$, we construct a family of 3-uniform bi-hypergraphs $calH$ with the feasible set $S$ and $r_{n_i}=s_i,i=1,2,\mathrm{...},t$, where each $r_{n_i}$ is the $n_i$th component of the chromatic spectrum of $calH$. 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.

Full work available at URL: https://arxiv.org/abs/1105.2672

Recommendations

• The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs
• On the chromatic numbers of some 3-uniform hypergraphs in the plane
• The intersection spectrum of 3‐chromatic intersecting hypergraphs
• Spectrum of mixed bi-uniform hypergraphs
• On 3-chromatically unique and 3-chromatically equivalent hypergraphs
• On the spectrum of 3-coloured digraphs
• The chromatic spectrum of mixed hypergraphs
• On a 3-uniform hypergraph coloring problem in the integers
• Edge-coloring of 3-uniform hypergraphs
• The spectrum of a class of uniform hypergraphs

zbMATH Keywords

feasible setchromatic spectrumbi-hypergraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Cites Work

• Title not available (Why is that?)
• The chromatic spectrum of mixed hypergraphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• On feasible sets of mixed hypergraphs
• Uniform mixed hypergraphs: the possible numbers of colors
• Title not available (Why is that?)

Cited In (13)

• Title not available (Why is that?)
• ℱ-WORM colorings of some 2-trees: partition vectors
• Spectrum of mixed bi-uniform hypergraphs
• On perfection and imperfection of one-realizations of a given set
• More result on the smallest one-realization of a given set
• The smallest one-realization of a given set. II.
• Biased graphs. III: Chromatic and dichromatic invariants
• The smallest one-realization of a given set. III
• The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs
• On the structure of uniform one-realizations of a given set
• More results on the smallest one-realization of a given set. II
• The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
• The smallest one-realization of a given set. IV

This page was built for publication: The chromatic spectrum of 3-uniform bi-hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409398)