Erdős on Graphs

Erdős on Graphs: His Legacy of Unsolved Problems is a book on unsolved problems in mathematics collected by Paul Erdős in the area of graph theory. It was written by Fan Chung and Ronald Graham, based on a 1997 survey paper by Chung,[1] and published in 1998 by A K Peters. A softcover edition with some updates and corrections followed in 1999.

Topics

The book has eight chapters, the first being a short introduction. Its main content are six chapters of unsolved problems, grouped by subtopic. Chapters two and three are on Ramsey theory and extremal graph theory. The fourth covers topics in graph coloring, packing problems, and covering problems. The fifth concerns graph enumeration and random graphs, the sixth generalizes from graphs to hypergraphs, and the seventh concerns infinite graphs. The book concludes with a chapter of stories about Erdős from one of his oldest friends, Andrew Vázsonyi.[1][2][3]

Each chapter begins with a survey of the history and major results in the subtopic of graph theory that it covers; Erdős himself figures prominently in the history of several of these subtopics.[4] The individual history, motivation, known progress, and bibliographic references for each problem are included, along with (in some cases) prizes for a solution originally offered by Erdős and maintained by Chung and Graham.[1][2][3]

Audience and reception

One target audience for the book is researchers in graph theory, for whom these problems may provide material for much future research.[1][5][4] They may also provide an inspiration for students of mathematics,[5] and reviewer Arthur Hobbs suggests that the book could even be used as the basis for a graduate course.[4] Additionally, reviewers Robert Beezer and W. T. Tutte suggest that the book may be of interests to mathematicians in other areas, and to historians of mathematics, for the insight it provides into Erdős's life and work.[3][6] Ralph Faudree writes that the book is suitable both as reference material and for browsing.[2]

Tutte notes, for those not familiar with the topic, that in mathematics, a well-posed and unsolved problem can itself be a significant contribution, a success rather than a failure.[6] In a similar vein of thought, Faudree adds that the book provides "an appropriate tribute" to Erdős and his history of both formulating and solving problems.[2]

gollark: 230GB of my laptop's 512GB disk is in use, because I have many `node_modules`es, Rust projects, large games, giant toolchains (CUDA), big pretrained neural networks, a full backup of my old laptop, and several thousand memes.
gollark: I guess big Rust projects would occupy a quarter of it.
gollark: It wouldn't be that bad with a cut-down Linux distribution.
gollark: Hello, my alt!
gollark: Try all rewinds until it works.

References
  1. Schelp, R. H. (1999), "Review of Erdős on Graphs", Mathematical Reviews, MR 1601954
  2. Faudree, R., "Review of Erdős on Graphs", zbMATH, Zbl 0890.05049
  3. Beezer, Robert A. (March 2000), "Review of Erdős on Graphs", SIAM Review, 42 (1): 143–145, JSTOR 2653387
  4. Hobbs, Arthur M. (April 2001), "Review of Graph Theory as I Have Known It and Erdős on Graphs", American Mathematical Monthly, 108 (4): 379–381, doi:10.2307/2695262, JSTOR 2695262
  5. Crilly, Tony (July 2001), "Review of Erdős on Graphs", The Mathematical Gazette, 85 (503): 375–377, doi:10.2307/3622075, JSTOR 3622075
  6. Tutte, W. T. (September 2000), "Review of Erdős on Graphs", SIAM Review, 42 (3): 548–549, JSTOR 2653326
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.