Skip to main content
SpringerLink
Log in

Hypergraphs with high chromatic number

  • Research Problems
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

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.

References

  1. Beck, J.: On three-chromatic hypergraphs. Discrete Math.29, 127–137 (1978)

    Article  Google Scholar 

  2. Erdös, P.: On a combinatorial problem II. Acta Math. Acad. Sci. Hung.15, 445–447 (1964)

    Article  MATH  Google Scholar 

  3. Erdös, P.: Some old and new problems in various branches of combinatorics. In: Proceedings of the Tenth Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium XXIII, pp. 19–37. Winnipeg: Utilitas Mathematica 1979

    Google Scholar 

  4. Erdös, P., Hajnal, A.: On a property of families of sets. Acta Math. Acad. Sci. Hung.12, 87–123 (1961)

    Article  MATH  Google Scholar 

  5. Erdös, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. In: Infinite and Finite Sets. Colloq. Math. Soc. János Bolyai10, 609–627 (1975)

  6. Frankl, P., Rödl, V.: Lower bounds for Turán's problem. Graphs and CombinatoricsI, 213–216 (1985)

    Article  Google Scholar 

  7. Kim, K.H., Roush, F.W.: On a problem of Turán. In: Studies in Pure Mathematics, pp. 423–425. Basel: Birkhäuser 1983

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Tel Aviv University, Ramat Aviv, Tel Aviv, Israel

    Noga Alon

  2. IBM Research Laboratory, San Jose, CA, USA

    Noga Alon

Authors
  1. Noga Alon
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alon, N. Hypergraphs with high chromatic number. Graphs and Combinatorics 1, 387–389 (1985). https://doi.org/10.1007/BF02582966

Download citation

  • Issue Date:

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

Keywords

Search

Navigation