David Défossez - A sufficient condition for bicolorable hypergraphs

dmtcs:3427 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3427
A sufficient condition for bicolorable hypergraphsArticle

Authors: David Défossez 1

  • 1 Laboratoire Leibniz

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

https://doi.org/10.46298/dmtcs.3427
Source: HAL:hal-01184384v1
Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: hypergraphs,coloring,Sterboul's conjecture,[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO] Mathematics [math]/Combinatorics [math.CO]

Share and export

Consultation statistics

This page has been seen 179 times.
This article's PDF has been downloaded 218 times.