Skip to main content
SpringerLink
Log in

On chromatic number of finite set-systems

  • Published:
Acta Mathematica Academiae Scientiarum Hungarica 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.

Institutional subscriptions

References

  1. R. L. Brooks, On colouring the nodes of a network,Proc. Cambridge Phil. Soc.,37 (1941), pp. 194–197.

    Google Scholar 

  2. Blanche Descartes, A three colour problem,Eureka (April 1947; solution March 1948) and Solution to Advanced Problem No. 4526,Amer. Math. Monthy,61 (1954), p. 352.

    Google Scholar 

  3. P. Erdős, Graph theory and probability,Canad. J. Math.,11 (1959), pp. 34–38.

    Google Scholar 

  4. P. Erdős andA. Hajnal, On chromatic number of graphs and set-systems,Acta Math. Acad. Sci. Hung.,17 (1966), pp. 61–99.

    Google Scholar 

  5. J. Nešetřil,к-хрматические графы без циклов длинны≦7,Comment. Math. Univ. Carolina,7 (1966), pp. 373–376.

    Google Scholar 

  6. A. A. Zykov, On some properties of linear complexes,Russian Math. Sbornik, N. S.24 (66) (1949), pp. 163–188.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Budapest

    L. Lovász

Authors
  1. L. Lovász
    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

Lovász, L. On chromatic number of finite set-systems. Acta Mathematica Academiae Scientiarum Hungaricae 19, 59–67 (1968). https://doi.org/10.1007/BF01894680

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation