scientific article; zbMATH DE number 3887740

From MaRDI portal
Publication:3222234





[For the entire collection see Zbl 0546.00006.] The authors positively answer the question is every normal hypergraph bichromatic by proving that a hypergraph with no odd cycles of maximal degree two is bichromatic. In an equivalent form, the set of all maximal cliques of a perfect graph can be partitioned into two classes such that these classes are represented at each vertex contained in at least two maximal cliques. A few results concerning the non-bichromatic hypergraphs are also provided in the paper.











This page was built for publication:

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