A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2

DOI10.1016/j.disc.2005.12.020zbMath1132.05021OpenAlexW2021091958MaRDI QIDQ2488941

Dieter Rautenbach, Ping Zhao, Kefeng Diao, Gui Zhen Liu

Publication date: 16 May 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.020

Mathematics Subject Classification ID

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

Related Items (8)

On perfection and imperfection of one-realizations of a given set ⋮ The smallest uniform color-bounded hypergraphs which are one-realizations of a given set ⋮ Maximum number of colors: C-coloring and related problems ⋮ On the structure of uniform one-realizations of a given set ⋮ More results on the smallest one-realization of a given set. II ⋮ Smallest set-transversals of \(k\)-partitions ⋮ Connected colourings of complete graphs and hypergraphs ⋮ The smallest one-realization of a given set. III

Cites Work

• Unnamed Item
• Unnamed Item
• Pseudo-chordal mixed hypergraphs
• Mixed interval hypergraphs
• Upper chromatic number of Steiner triple and quadruple systems
• About the upper chromatic number of a co-hypergraph
• Uncolorable mixed hypergraphs

This page was built for publication: A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2