A sufficient condition for the bicolorability of a hypergraph

DOI10.1016/J.DISC.2006.09.052MaRDI QIDQ2483408zbMATH OpenOpenAlexFDO

Authors David Défossez

Publication date 28 April 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.09.052

zbMATH Keywords

bicolorable hypergraphsodd hypercyclesSterboul conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 3887740
• Conditions for the bicolorability of primitive hypergraphs
• scientific article; zbMATH DE number 3435542
• scientific article; zbMATH DE number 4072998
• Some properties of non-bicolorable hypergraphs and the four-color problem

Cites work

• Decomposition of balanced matrices
• scientific article; zbMATH DE number 3887740 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 863476 (Why is no real title available?)
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Une classe d'hypergraphes bichromatiques. II

Cited in

(3)

• Conditions for the bicolorability of primitive hypergraphs
• scientific article; zbMATH DE number 3887740 (Why is no real title available?)
• scientific article; zbMATH DE number 3435542 (Why is no real title available?)

This page was built for publication: A sufficient condition for the bicolorability of a hypergraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483408)