Skip to main content
SpringerLink
Log in

Every 8-uniform 8-regular hypergraph is 2-colorable

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

As is well known, Lovász Local Lemma implies that everyd-uniformd-regular hypergraph is 2-colorable, providedd ≥ 9. We present a different proof of a slightly stronger result; everyd-uniformd-regular hypergraph is 2-colorable, providedd ≥ 8.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Egorichev, G.P.: The solution of the Van der Waerden problem for permanents. Dokl. Acad. Nauk SSSR258, 1041–1044 (1981)

    Google Scholar 

  2. Falikman, D.I.: A proof of Van der Waerden's conjecture on the permanent of a doubly stochastic matrix. Mat. Zametki29, 931–938 (1981)

    Google Scholar 

  3. Friedland, S.: Every 7-regular digraph contains an even cycle. (to appear)

  4. Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. p. 90. New York: Wiley Interscience 1980

    Google Scholar 

  5. Hall, M.: Combinatorial Theory. pp. 45–46. New York: Wiley 1967

    Google Scholar 

  6. Spencer, J.: Ten Lectures on the Probabilistic Method. p. 59. Philadelphia: SIAM 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematical Sciences, Sackler Faculty of Exact Sciences Tel Aviv University, Ramat Aviv, Tel Aviv, Israel

    N. Alon & Z. Bregman

Authors
  1. N. Alon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Z. Bregman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by Allon Fellowship and by a grant from the United States Israel Binational Science Foundation.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N., Bregman, Z. Every 8-uniform 8-regular hypergraph is 2-colorable. Graphs and Combinatorics 4, 303–306 (1988). https://doi.org/10.1007/BF01864169

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01864169

Keywords

Search

Navigation