A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
The upper chromatic number \(\xi(\overline {{\mathcal H}})\) of a hypergraph \({\mathcal H}=(X,{\mathcal E})\) is the maximum number \(k\) for which there exists a partition of \(X\) into nonempty subsets \(X_{1}, X_{2}, X_{k}\) such that for each edge at least two vertices lie in one of the partite sets. We prove that for every \(n>3\) there exists a 3-uniform hypergraph with \(n\) vertices, upper chromatic number \(2\) and \(\frac{n(n-2)}{3}\) edges which implies that a corresponding bound proved by \textit{K. Diao, P. Zhao} and \textit{H. Zhou} [Discrete Math. 220, No.\,1-3, 67--73 (2000; Zbl 0949.05031)] is best-possible.
- An upper bound to the chromatic number of a uniform hypergraph without cycles of length two or three
- On the chromatic numbers of some 3-uniform hypergraphs in the plane
- Edge-coloring of 3-uniform hypergraphs
- On the construction of 3-chromatic hypergraphs with few edges
- The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs
- On the Erdős-Hajnal problem for 3-uniform hypergraphs
- An upper bound for the 3-tone chromatic number of graphs with maximum degree 3
- A note on the chromaticity of some 2-connected (n,n+3)-graphs
- On the number of edges of a uniform hypergraph with a range of allowed intersections
- On 3-chromatically unique and 3-chromatically equivalent hypergraphs
- About the upper chromatic number of a co-hypergraph
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 786134 (Why is no real title available?)
- Mixed interval hypergraphs
- Pseudo-chordal mixed hypergraphs
- Uncolorable mixed hypergraphs
- Upper chromatic number of Steiner triple and quadruple systems
- On the structure of uniform one-realizations of a given set
- More results on the smallest one-realization of a given set. II
- The minimum chromatic spectrum of 3-uniform \(\mathcal{C}\)-hypergraphs
- On the construction of 3-chromatic hypergraphs with few edges
- The smallest uniform color-bounded hypergraphs which are one-realizations of a given set
- On perfection and imperfection of one-realizations of a given set
- Upper bounds on minimum number of \(\mathcal{C}\)-edges of 4-uniform \(\mathcal{C}\)-hypergraphs
- Maximum number of colors: C-coloring and related problems
- Connected colourings of complete graphs and hypergraphs
- The smallest one-realization of a given set. III
- Smallest set-transversals of \(k\)-partitions
This page was built for publication: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2488941)
