Skip to main content
SpringerLink
Log in

Sketchy Tweets: Ten Minute Conjectures in Graph Theory

  • Article
  • Published:
The Mathematical Intelligencer Aims and scope Submit manuscript

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

References

  1. K. Appel, W. Haken, J. Koch, Every planar map is four colorable, Illinois J. Math. 21 (1977), 439–567.

    Google Scholar 

  2. A. M. Barcalkin, L. F. German, The external stability number of the Cartesian product of graphs, Bul. Akad. Stiinte RSS Moldoven, 94 (1979), 5–8.

    MathSciNet  Google Scholar 

  3. A. Bonato, R. J. Nowakowski, The Game of Cops and Robbers on Graphs, American Mathematical Society, Providence, Rhode Island, 2011.

  4. J. A. Bondy, A Graph Reconstructor’s Manual, Surveys in Combinatorics, 1991 (Guildford, 1991), London Mathematical Society Lecture Note Series, 166, Cambridge University Press, Cambridge, 1991, pp. 221–252.

  5. B. Brec̆ar, P. Dorbec, W. Goddard, B. L. Hartnell, M. A. Henning, S. Klavžar, D. F. Rall, Vizing’s conjecture: a survey and recent results, J. Graph Theory 1(2012), 46–76.

    Google Scholar 

  6. U. Celmins, On cubic graphs that do not have an edge-3-coloring, Ph.D. Thesis, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada, 1984.

  7. R. Christian, B. R. Richter, G. Salazar, Zarankiewicz’s conjecture is finite for each fixed m, Preprint 2011.

  8. F. R. K. Chung, Open problems of Paul Erdős in graph theory, J. Graph Theory 25 (1997), 3–36.

    Article  MATH  MathSciNet  Google Scholar 

  9. R. Diestel, Graph Theory, Springer-Verlag, New York, 2000.

    Google Scholar 

  10. G. A. Dirac, A property of 4-chromatic graphs and some remarks on critical graphs, J. Lond. Math. Soc. 27 (1952), 85–92.

    Article  MATH  MathSciNet  Google Scholar 

  11. P. Erdős, Some remarks on the theory of graphs, Bull. Amer. Math. Soc. 53 (1947), 292–294.

    Article  MathSciNet  Google Scholar 

  12. P. Frankl, Cops and robbers in graphs with large girth and Cayley graphs, Discrete Appl. Math. 17 (1987), 301–305.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. A. Gallian, A dynamic survey of graph labeling, Electr. J. Comb. DS6 (2002).

  14. R. K. Guy, The Decline and Fall of Zarankiewicz’s Theorem, Proof Techniques in Graph Theory (Proc. Second Ann Arbor Graph Theory Conf., Ann Arbor, Mich., 1968), Academic Press, New York, 1969, pp. 63–69.

  15. H. Hadwiger, Über eine Klassifikation der Streckenkomplexe, Vierteljschr. Naturforsch. Ges. ZÜrich 88 (1943), 133–143.

    MathSciNet  Google Scholar 

  16. R. Hamming, You and Your Research. Accessed December 14, 2011. http://www.cs.virginia.edu/~robins/YouAndYourResearch.html.

  17. S. Hedetniemi, Homomorphisms of graphs and automata, Technical Report 03105-44-T, 1966.

  18. C. Hierholzer, Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren, Mathematische Annalen 6 (1873), 30–32.

    Article  MathSciNet  Google Scholar 

  19. F. Jaeger, Flows and generalized coloring theorems in graphs, J. Combin. Theory Ser. B 26 (1979), 205–216.

    Article  MATH  MathSciNet  Google Scholar 

  20. F. Jaeger, A survey of the cycle double cover conjecture, Ann. Discrete Math. 27 (1985), 1–12.

    MathSciNet  Google Scholar 

  21. K. Kawarabayashi, B. Toft, Any 7-chromatic graph has K 7 or K 4,4 as a minor, Combinatorica 25 (2005), 327–353.

  22. P. J. Kelly, A congruence theorem for trees, Pacific J. Math. 7 (1957), 961–968.

    MATH  MathSciNet  Google Scholar 

  23. D. J. Kleitman, The crossing number of K 5,n , J. Combinatorial Theory 9 (1970), 315–323.

    Article  MATH  MathSciNet  Google Scholar 

  24. Open Problem Garden. Accessed August 23, 2011. http://garden.irmacs.sfu.ca/.

  25. S. P. Radziszowski, Small Ramsey numbers, Electr. J. Comb., Dynamic Survey DS1.

  26. F. P. Ramsey, On a problem of formal logic, Proc. Lond. Math. Soc. 30 (1930), 264–286.

    Article  Google Scholar 

  27. G. Ringel, problem 25, In: Theory of Graphs and Its Applications, Proc. Symp. Smolenice, 1963, G/A Czech. Acad. Sci. 162 (1964).

  28. N. Robertson, P. Seymour, R. Thomas, Hadwiger’s conjecture for K 6-free graphs, Combinatorica 13 (1993), 279–361.

    Article  MATH  MathSciNet  Google Scholar 

  29. N. Sauer, Hedetniemi’s conjecture: a survey, Discrete Math. 229 (2001), 261–292.

    Article  MATH  MathSciNet  Google Scholar 

  30. P. D. Seymour, Sums of circuits, In: Graph Theory and Related Topics, J. A. Bondy and U. S. R. Murty (eds.), Academic Press, New York (1979), pp. 341–355.

    Google Scholar 

  31. P. D. Seymour, Nowhere-zero 6-flows, J. Combin. Theory Ser. B 30 (1981), 130–135.

    Article  MATH  MathSciNet  Google Scholar 

  32. J. H. Spencer, Ramsey’s theorem—a new lower bound, J. Combin. Theory Ser. A 18 (1975), 108–115.

    Article  MATH  Google Scholar 

  33. R. Steinberg, Tutte’s 5-flow conjecture for the projective plane, J. Graph Theory 8 (1984), 277–289.

    Article  MATH  MathSciNet  Google Scholar 

  34. G. Szekeres, Polyhedral decomposition of cubic graphs, Bull. Aust. Math. Soc. 8 (1973), 367–387.

    Article  MATH  MathSciNet  Google Scholar 

  35. C. Tardif, Hedetniemi’s conjecture, 40 years later, Graph Theory Notes N.Y., 54 (2008), 46–57.

    MathSciNet  Google Scholar 

  36. A. Thomason, An upper bound for some Ramsey numbers, J. Graph Theory 12 (1988), 509–517.

    Article  MATH  MathSciNet  Google Scholar 

  37. W. T. Tutte, A contribution to the theory of chromatic polynomials, Canad. J. Math. 6 (1954), 80–91.

    Article  MATH  MathSciNet  Google Scholar 

  38. S. M. Ulam, A Collection of Mathematical Problems, Wiley, New York, 1960.

    MATH  Google Scholar 

  39. V. G. Vizing, Some unsolved problems in graph theory, Uspehi Mat. Nauk 23 (1968), 117–134.

    MATH  MathSciNet  Google Scholar 

  40. K. Wagner, Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570–590.

    Article  MathSciNet  Google Scholar 

  41. D. B. West, Introduction to Graph Theory, 2nd edition, Prentice Hall, 2001.

  42. Wikipedia: Glossary of Graph Theory, Accessed December 14, 2011. http://en.wikipedia.org/wiki/Glossary of graph theory.

  43. D. R. Woodall, Cyclic order graphs and Zarankiewicz’s crossing number conjecture, J. Graph Theory 17 (1993), 657–671.

    Article  MATH  MathSciNet  Google Scholar 

  44. K. Zarankiewicz, On a problem of P. Turán concerning graphs, Fund. Math. 41 (1954), 137–145.

    MATH  MathSciNet  Google Scholar 

  45. C. Q. Zhang, Integer Flows and Cycle Covers of Graphs, Marcel Dekker Inc., New York, 1997.

    Google Scholar 

  46. X. Zhu, A survey on Hedetniemi’s conjecture, Taiwanese J. Math. 2 (1998), 1–24.

    MATH  MathSciNet  Google Scholar 

  47. L. Beineke, R. Wilson, The early history of the brick factory problem, Math. Int. 32 (2010), no. 2, 41–48.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Ryerson University, Toronto, M5B 2K3, Canada

    Anthony Bonato

  2. Department of Mathematics and Statistics, Dalhousie University, Halifax, NS, B3J 3H5, Canada

    Richard J. Nowakowski

Authors
  1. Anthony Bonato
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Richard J. Nowakowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anthony Bonato.

Additional information

The authors gratefully acknowledge support from NSERC, MITACS, and Ryerson.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bonato, A., Nowakowski, R.J. Sketchy Tweets: Ten Minute Conjectures in Graph Theory. Math Intelligencer 34, 8–15 (2012). https://doi.org/10.1007/s00283-012-9275-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00283-012-9275-2

Keywords

Search

Navigation