Skip to main content

A Glimpse on Graph Theory

  • Chapter
  • First Online:
  • 2734 Accesses

Part of the book series: Problem Books in Mathematics ((PBM))

Abstract

We begin this chapter by considering the following three combinatorial problems.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   84.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    Actually, as we shall see later, Euler is usually credited as being the founder of Graph Theory.

  2. 2.

    After Václav J. Havel , Czech mathematician, and Seifollah L. Hakimi , Iranian-American mathematician, both of the twentieth century.

  3. 3.

    After Julius P. C. Petersen, Danish mathematician of the nineteenth century.

  4. 4.

    For another approach to this problem, see Problem 5, page 49.

  5. 5.

    After Dénes König , Hungarian mathematician of the twentieth century.

  6. 6.

    Note that, in principle, this definition of path does not coincide with the one given in the text. Nevertheless, we have chosen to translate it according to the original.

  7. 7.

    We call the reader’s attention for not confusing notations w(G) for the weight of a weighted graph and ω(G) for the clique number of a graph; the first uses the Latin letter w, whereas the second uses the Greek letter ω ( omega).

  8. 8.

    In terms of Logic, an implication is true whenever it premise is false. See Chapter 1 of [34], for instance.

  9. 9.

    Note that this is precisely Turán’s number T(n; l) when n = (l − 1)q.

References

  1. T. Apostol, Calculus, Vol. 2 (Wiley, New York, 1967)

    Google Scholar 

  2. R. Diestel, Graph Theory (Springer, New York, 2000)

    Google Scholar 

  3. S.B. Feitosa, Turán’s Theorem (in Portuguese) (Classnotes, 2006)

    Google Scholar 

  4. N. Hartsfield, G. Ringel, Pearls in Graph Theory (Academic Press, San Diego, 1990)

    MATH  Google Scholar 

  5. E. Scheinerman, Mathematics: A Discrete Introduction, 3rd edn. (Brooks Cole, Boston, 2012)

    MATH  Google Scholar 

  6. P. Turán, An extremal problem in graph theory. Mat. Fiz. Lapok 41, 435–452 (1941)

    Google Scholar 

  7. J.H. Van Lint, R.M. Wilson, Combinatorics (Cambridge University Press, Cambridge, 2001)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Caminha Muniz Neto, A. (2018). A Glimpse on Graph Theory. In: An Excursion through Elementary Mathematics, Volume III. Problem Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-77977-5_5

Download citation

Publish with us

Policies and ethics