On 2-coloring certain \(k\)-uniform hypergraphs
type: Item
instance of: scholarly article
title: On 2-coloring certain \(k\)-uniform hypergraphs
zbMATH Open document ID: 1010.05027
DOI: 10.1016/S0097-3165(02)00024-9
author: Sundar Vishwanathan
published in: Journal of Combinatorial Theory. Series A
publication date: 2003-03-26T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 1888446
zbMATH Keywords: colouring
zbMATH Keywords: hypergraph
zbMATH Keywords: permanent
zbMATH Keywords: quasi-matching
reviewed by: Gabriel Semanišin
MaRDI profile type: Publication
cites work: Combinatorial Nullstellensatz
cites work: Every 8-uniform 8-regular hypergraph is 2-colorable
cites work: Regular subgraphs of almost regular graphs
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Colorings and orientations of graphs
cites work: Improved bounds and algorithms for hypergraph 2-coloring
cites work: ON THE TWO-COLOURING OF HYPERGRAPHS
cites work: The Even Cycle Problem for Directed Graphs
description: scientific article; zbMATH DE number 1888446