Skip to main content

The minimality of the mycielski graph

Part III: Contributed Papers New Results On Graphs And Combinatorics

Part of the Lecture Notes in Mathematics book series (LNM,volume 406)

Abstract

It is proved that the smallest 4-chromatic triangle — free graph has eleven vertices and is unique.

Keywords

  • Graph Theory
  • Large Degree
  • Strong Statement
  • Chromatic Number
  • Explicit Construction

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.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brooks, R. L., On Colouring the Nodes of a Network, Proc. Cambridge Phil. Soc. 37 (1941), 194–197.

    CrossRef  MathSciNet  Google Scholar 

  2. Chvátal, V., The Smallest Triangle-free 4-chromatic 4-regular Graph, J. Com J. Combinatorial Theory 9 (1970), 93–94.

    CrossRef  MATH  Google Scholar 

  3. Erdös, P., Graph Theory and Probability, Canad. J. Math. 11 (1959), 34–38.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. Harary, F., Graph Theory, Addison-Wesley, Reading, Mass., 1969, p. 149, Exercise 12.19.

    Google Scholar 

  5. Lovász, L., On the Chromatic Number of Finite Set-systems, Acta. Math. Acad. Sci. Hungar. 19 (1968), 59–67.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. Mycielski, J., Sur le coloriage des graphes, Colloq. Math. 3 (1955), 161–162.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1974 Springer-Verlag Berlin

About this paper

Cite this paper

Chvátal, V. (1974). The minimality of the mycielski graph. In: Bari, R.A., Harary, F. (eds) Graphs and Combinatorics. Lecture Notes in Mathematics, vol 406. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0066446

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06854-9

  • Online ISBN: 978-3-540-37809-9

  • eBook Packages: Springer Book Archive