A sufficient condition for bicolorable hypergraphs

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

Bibliographic Details
Main Author:	David Défossez
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2005-01-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	hypergraphs coloring sterboul's conjecture [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] [math.math-co] mathematics [math]/combinatorics [math.co]
Online Access:	https://dmtcs.episciences.org/3427/pdf

Internet

https://dmtcs.episciences.org/3427/pdf