DMTCS Proceedings, 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)

Font Size:  Small  Medium  Large

A sufficient condition for bicolorable hypergraphs

David Défossez


In this note we prove Sterboul's conjecture, that provides a sufficient condition for the bicolorability of hypergraphs.

Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page

Valid XHTML 1.0 Transitional