Skip to main content
SpringerLink
Log in

New Construction of Graphs with High Chromatic Number and Small Clique Number

  • Published:
Discrete & Computational Geometry Aims and scope Submit manuscript

Abstract

We introduce a new method for constructing graphs with high chromatic number and small clique number. Indeed, we present a new proof for the well-known Kneser conjecture via this method.

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. Alishahi, M.: Colorful subhypergraphs in uniform hypergraphs. Electron. J. Comb. 24(1), Paper No. P1.23 (2017)

  2. Alishahi, M., Hajiabolhassan, H.: On the chromatic number of general Kneser hypergraphs. J. Comb. Theory, Ser. B 115, 186–209 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bárány, J.: A short proof of Kneser’s conjecture. J. Comb. Theory, Ser. A 25(3), 325–326 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  4. Daneshpajouh, H.R.: A topological lower bound for the chromatic number of a special family of graphs (2016). arXiv:1611.06974v3

  5. Descartes, B.: A three colour problem. Eureka 9(21), 24–25 (1947)

    Google Scholar 

  6. Dold, A.: Simple proofs of some Borsuk–Ulam results. In: Miller, H.R., Priddy, S.B. (eds.) Proceedings of the Northwestern Homotopy Theory Conference. Contemporary Mathematics, vol. 19, pp. 65–69. American Mathematical Society, Providence (1983)

  7. Erdős, P.: Graph theory and probability. Can. J. Math 11, 34–38 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  8. Greene, J.E.: A new short proof of Kneser’s conjecture. Am. Math. Mon. 109(10), 918–920 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  9. http://www.openproblemgarden.org/category/triangle_free

  10. Kelly, J.B., Kelly, L.M.: Paths and circuits in critical graphs. Am. J. Math. 76(4), 786–792 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kneser, M.: Aufgabe 360. Jahresbericht der Deutschen Mathematiker-Vereinigung, 2. Abteilung 58, 27 (1955)

  12. Kostochka, A.V.: Degree, girth and chromatic number. In: Hajnal, A., Sós, V.T. (eds.) Combinatorics, vol. 2. Colloquia Mathematica Societatis János Bolyai, vol. 18, pp. 679–696. North-Holland, Amsterdam (1978)

  13. Kozlov, D.: Combinatorial Algebraic Topology. Algorithms and Computation in Mathematics. Springer, Berlin (2008)

    Book  Google Scholar 

  14. Lovász, L.: Kneser’s conjecture, chromatic number, and homotopy. J. Comb. Theory, Ser. A 25(3), 319–324 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  15. Matoušek, J.: A combinatorial proof of Kneser’s conjecture. Combinatorica 24(1), 163–170 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  16. Matoušek, J.: Using the Borsuk–Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry. Universitext. Springer, Berlin (2003)

    MATH  Google Scholar 

  17. Mycielski, J.: Sur le coloriage des graphs. Colloq. Math. 3, 161–162 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  18. Pálvölgyi, D.: Combinatorial necklace splitting. Electron. J. Comb. 16(1), Paper No. R79 (2009)

  19. Reed, B.: \({\omega, \Delta } \) and \({\chi } \). J. Graph Theory 27(4), 177–212 (1998)

    Article  MathSciNet  Google Scholar 

  20. Steinlein, H.: Borsuk’s antipodal theorem and its generalizations and applications: a survey. In: Granas, A. (ed.) Topological Methods in Nonlinear Analysis. Séminaire Mathematique Supérieure, vol. 95, pp. 166–235. Presses de l’Université de Montréal, Montréal (1985)

    Google Scholar 

  21. Tucker, A.W.: Some topological properties of disk and sphere. In: Proceedings of the First Canadian Mathematical Congress, pp. 285–309. University of Toronto Press, Toronto (1946)

  22. Ziegler, G.M.: Generalized Kneser coloring theorems with combinatorial proofs. Invent. Math. 147(3), 671–691 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  23. Zykov, A.A.: On some properties of linear complexes. Mat. Sb. 24(66)(2), 163–188 (1949) (in Russian)

Download references

Acknowledgements

This is a part of the author’s Ph.D. thesis, under the supervision of Professor Hossein Hajiabolhassan. I would like to express my sincere gratitude to him for the continuous support of my Ph.D. study and related research, for his patience, motivation, and immense knowledge.

Author information

Authors and Affiliations

  1. School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran

    Hamid Reza Daneshpajouh

  2. Moscow Institute of Physics and Technology, Institutsky Lane 9, Dolgoprudny, Moscow Region, Russia, 141700

    Hamid Reza Daneshpajouh

Authors
  1. Hamid Reza Daneshpajouh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hamid Reza Daneshpajouh.

Additional information

Editor in Charge: János Pach

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Daneshpajouh, H.R. New Construction of Graphs with High Chromatic Number and Small Clique Number. Discrete Comput Geom 59, 238–245 (2018). https://doi.org/10.1007/s00454-017-9934-3

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00454-017-9934-3

Keywords

Mathematics Subject Classification

Search

Navigation