Skip to main content
SpringerLink
Log in

Ahypergraph-free construction of highly chromatic graphs without short cycles

  • Notes
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

We present a purely graph-theoretical construction of highly chromatic graphs without short cycles.

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. L. Lovász, On chromatic numbers of graphs and set systems,Acta Math. Acad. Sci. Hungar.,17 (1966), 61–99.

    Google Scholar 

  2. J. Nešetřil,k-chromatic graphs without cycles of length ≦ 7,Comment. Math. Univ. Carol.,7 (1966), 373–376.

    Google Scholar 

  3. J. Nešetřil, Amalgamation of graphs and its application,Ann. New York Acad. Sci.,319. New York (1979), 415–428.

    Google Scholar 

  4. J. Nešetřil andV. Rödl, A Short Proof of the Existence of Highly Chromatic Hypergraphs without Short Cycles,J.C.T.,27 (1979), 225–227.

    Google Scholar 

  5. H. Walther andH. J. Voss,Über Kreise in Graphen, Deutscher Verlag der Wissenschaften, Berlin, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Ohio State University, 43210, Columbus, Ohio, USA

    Igor Kříž

Authors
  1. Igor Kříž
    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

Kříž, I. Ahypergraph-free construction of highly chromatic graphs without short cycles. Combinatorica 9, 227–229 (1989). https://doi.org/10.1007/BF02124683

Download citation

  • Received:

  • Issue Date:

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

AMS subject classification (1980)

Search

Navigation