Skip to main content
Log in

A generalization of Kónig's theorem

  • 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

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

References

  1. 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 

  2. D. Kőnig,Theorie der endlichen und unendlichen Graphen (Leipzig, 1936).

  3. L. Lovász, On chromatic number of finite set-systems,Acta Math. Acad. Sci. Hung.,19 (1968), pp. 59–67.

    Google Scholar 

  4. L. Lovász, Graphs and set-systems,Beiträge zur Graphentheorie (Leipzig, 1968).

  5. O. Ore,Theory of graphs, Amer. Math. Soc. Coll. Publ.38 (1962).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lovász, L. A generalization of Kónig's theorem. Acta Mathematica Academiae Scientiarum Hungaricae 21, 443–446 (1970). https://doi.org/10.1007/BF01894789

Download citation

  • Received:

  • Issue Date:

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

Navigation