
Erdos on Graphs
His Legacy of Unsolved Problems
CRC Press
1st Edition
Published on 12. December 2019
Book
Paperback/Softback
142 pages
978-0-367-44793-9 (ISBN)
Description
This book is a tribute to Paul Erd\H{o}s, the wandering mathematician once described as the "prince of problem solvers and the absolute monarch of problem posers." It examines -- within the context of his unique personality and lifestyle -- the legacy of open problems he left to the world after his death in 1996. Unwilling to succumb to the temptations of money and position, Erd\H{o}s never had a home and never held a job. His "home" was a bag or two containing all his belongings and a record of the collective activities of the mathematical community. His "job" was one at which he excelled: identifying a fundamental roadblock in some particular line of approach and capturing it in a well-chosen, often innocent-looking problem, whose solution would likewise provide insight into the underlying theory. By cataloguing the unsolved problems of Erd\H{o}s in a comprehensive and well-documented volume, the authors hope to continue the work of an unusual and special man who fundamentally influenced the field of mathematics.
More details
Language
English
Place of publication
London
United Kingdom
Publishing group
Taylor & Francis Ltd
Target group
Professional and scholarly
Academic and Professional Practice & Development
Dimensions
Height: 234 mm
Width: 184 mm
Weight
453 gr
ISBN-13
978-0-367-44793-9 (9780367447939)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions

E-Book
01/1998
1st Edition
CRC Press
€86.99
Available for download

Book
01/1998
1st Edition
A K Peters
€259.98
Shipment within 3-4 weeks

E-Book
01/1998
CRC Press
€86.99
Available for download
Persons
Chung, Fan; Graham, Ron
Content
1. Introduction 2. Ramsey Theory 3. Extremal Graph Theory 4. Coloring, Packing, and Covering 5. Random Graphs and Graph Enumeration 6. Hypergraphs 7. Infinite Graphs