About this Website
- All (170)
- Ramsey Theory (40)
- Extremal Graph Theory (40)
- Coloring, Packing, and Covering (25)
- Random Graphs and Graph Enumeration (16)
- Hypergraphs (35)
- Infinite Graphs (14)
About This Site
The Erdos problem page began in 2010 as a summer project for students of Fan Chung. The intention of the site is to be a collection of some of the most difficult problems in graph theory and as any progress towards their solutions. It is meant to be both an inspiration for those looking for difficult problems to tackle, as well as a resource for those wanting to see the most recent progress.
If there is progress on a problem that is not indicated on this site, or if you have any other comments, please feel free to email us at firstname.lastname@example.org.
Students who have worked on this page: