Skip to main content
Skip to search
Open Access Journals
Sign in
(new window)
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Sign in
(new window)
Articles & Issues
All articles
All accepted articles
All volumes
Last volume
Sections
Special issues
Authors
About
The journal
Indexing
Boards
Publish
For authors
Ethical charter
Submit
Home > Articles & Issues >
Articles >
A sufficient conditi ...
Conference paper
A sufficient condition for bicolorable hypergraphs
David Défossez
(1)
(1) Laboratoire Leibniz
Download article
Open on HAL
Cite
Metadata
TEI
Dublin Core
Crossref
ZB Jats
DOAJ
BibTeX
CSL
OpenAire
JSON
Share
Bluesky
Facebook
LinkedIn
Mail
WhatsApp
X
Publication details
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Proceedings
DOI
10.46298/dmtcs.3427
License
https://about.hal.science/hal-authorisation-v1
Indicators
444
Views
465
Downloads
A sufficient condition for bicolorable hypergraphs
David Défossez
(1)
(1) Laboratoire Leibniz
Abstract
In this note we prove Sterboul's conjecture, that provides a sufficient condition for the bicolorability of hypergraphs.
Keywords
[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
hypergraphs
coloring
Sterboul's conjecture
Preview
Loading PDF preview...
