On 2-coloring certain \(k\)-uniform hypergraphs (Q1865419): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q593274 |
||
Property / reviewed by | |||
Property / reviewed by: Gabriel Semanisin / rank | |||
Revision as of 19:40, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On 2-coloring certain \(k\)-uniform hypergraphs |
scientific article |
Statements
On 2-coloring certain \(k\)-uniform hypergraphs (English)
0 references
26 March 2003
0 references
Some sufficient conditions for the existence of a \(2\)-colouring of \(k\)-uniform hypergraphs are presented. When the number of edges of a hypergraph \(H\) equals to the number of elements of the base set of \(H\), the conditions are connected with properties of the permanent of the incidence matrix of \(H\). The used method of proof was already described by \textit{A. Noga} in [Comb. Probab. Comput. 8, 7-29 (1999; Zbl 0920.05026)]. In the general case, the sufficient condition is related to the number of quasi-matchings in an associated graph.
0 references
colouring
0 references
hypergraph
0 references
permanent
0 references
quasi-matching
0 references