Open problems of Paul Erdős in Graph Theory (1997)
| Venue: | JOURNAL OF GRAPH THEORY |
| Citations: | 9 - 0 self |
BibTeX
@ARTICLE{Chung97openproblems,
author = {F. R. K. Chung},
title = {Open problems of Paul Erdős in Graph Theory},
journal = {JOURNAL OF GRAPH THEORY},
year = {1997},
volume = {25},
pages = {3--36}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The main treasure that Paul Erdős has left us is his collection of problems, most of which are still open today. These problems are seeds that Paul sowed and watered by giving numerous talks at meetings big and small, near and far. In the past, his problems have spawned many areas in graph theory and beyond (e.g., in number theory, probability, geometry, algorithms and complexity theory). Solutions or partial solutions to Erdős problems usually lead to further questions, often in new directions. These problems provide inspiration and serve as a common focus for all graph theorists. Through the problems, the legacy of Paul Erdős continues (particularly if solving one of these problems results in creating three new problems, for example.) There is a huge literature of almost 1500 papers written by Erdős and his (more than 460) collaborators. Paul wrote many problem papers, some of which appeared in various (really hard-to-find) proceedings. Here is an attempt to collect and organize these problems in the area of graph theory. The list here is by no means complete or exhaustive. Our goal is to state the problems, locate the sources, and provide the references related to these problems. We will include the earliest and latest known references without covering the entire history of the problems because of space limitations. (The most up-to-date list of Erdős’ papers can be found in [65]; an electronic file is maintained by Jerry Grossman at
