On chromatic number of finite set-systems

  • L. Lovász


Chromatic Number 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    R. L. Brooks, On colouring the nodes of a network,Proc. Cambridge Phil. Soc.,37 (1941), pp. 194–197.Google Scholar
  2. [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. [3]
    P. Erdős, Graph theory and probability,Canad. J. Math.,11 (1959), pp. 34–38.Google Scholar
  4. [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. [5]
    J. Nešetřil,к-хрматические графы без циклов длинны≦7,Comment. Math. Univ. Carolina,7 (1966), pp. 373–376.Google Scholar
  6. [6]
    A. A. Zykov, On some properties of linear complexes,Russian Math. Sbornik, N. S.24 (66) (1949), pp. 163–188.Google Scholar

Copyright information

© Akadémiai Kiadó 1968

Authors and Affiliations

  • L. Lovász
    • 1
  1. 1.Budapest

Personalised recommendations