On 2-coloring certain k-uniform hypergraphs

Authors:
Sundar Vishwanathan
Affiliations:
Department of Computer Science and Engineering, Indian Institute of Technology, Powai, Bombay 400076, India
Venue:
Journal of Combinatorial Theory Series A
Year:
2003

Citing 2
Cited 0

Improved bounds and algorithms for hypergraph 2-coloring

Random Structures & Algorithms
Combinatorial Nullstellensatz

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give some sufficient conditions for the existence of a 2-coloring for k-uniform hypergraphs. When the number of edges equals the size of the base set of the hypergraph, these conditions are based on the permanent of the incidence matrix.