Problems and Results on 3-chromatic Hypergraphs and Some Related Questions

@inproceedings{LovszProblemsAR,
title={Problems and Results on 3-chromatic Hypergraphs and Some Related Questions},
author={P. Erdos-L Lov{\'a}sz}
}

P. Erdos-L Lovász

A hypergraphi is a collection of sets. This paper deals with finite hy-pergraphs only. The sets in the hypergraph are called edges, the elements of these edges are points. The degree of a point is the number of edges containing it. The hypergraph is r-uniform if every edge has r points. A hypergraph is simple if any two edges have at most one common point, and it is called a clique if any two edges have at least one common point. The chromatic number of a hypergraph is the least number k such… CONTINUE READING