Graham, Ronald L. 1935
Overview
Works:  187 works in 658 publications in 5 languages and 9,376 library holdings 

Genres:  Puzzles and games Conference papers and proceedings Handbooks and manuals Documentary films Biography Biographical films Nonfiction films Film adaptations 
Roles:  Author, Editor, Director, Other, Interviewee 
Classifications:  QA39.2, 510 
Publication Timeline
.
Most widely held works about
Ronald L Graham
 On a number theoretic conjecture of Graham by William WingCheung Wong( )
 Mathematical carnival : from penny puzzles, card shuffles, and tricks of lightning calculators to rolller coaster rides into the fourth dimension. A roundup of tantalizers from scientific American by Martin Gardner( Book )
 Graham, Ronald Lewis : mathematics( )
 Numerical TicTacToe by George Markowsky( Book )
Most widely held works by
Ronald L Graham
Concrete mathematics : a foundation for computer science by
Ronald L Graham(
Book
)
107 editions published between 1988 and 2017 in 3 languages and held by 1,851 WorldCat member libraries worldwide
107 editions published between 1988 and 2017 in 3 languages and held by 1,851 WorldCat member libraries worldwide
Ramsey theory by
Ronald L Graham(
Book
)
31 editions published between 1980 and 2013 in English and Undetermined and held by 1,029 WorldCat member libraries worldwide
"Discrete mathematics, the study of finite structures, is one of the fastestgrowing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the everincreasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms."Book cover
31 editions published between 1980 and 2013 in English and Undetermined and held by 1,029 WorldCat member libraries worldwide
"Discrete mathematics, the study of finite structures, is one of the fastestgrowing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the everincreasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms."Book cover
Handbook of combinatorics by
Ronald L Graham(
Book
)
17 editions published in 1995 in English and Italian and held by 541 WorldCat member libraries worldwide
17 editions published in 1995 in English and Italian and held by 541 WorldCat member libraries worldwide
Rudiments of Ramsey theory by
Ronald L Graham(
Book
)
35 editions published between 1980 and 2015 in English and Russian and held by 529 WorldCat member libraries worldwide
In every sufficiently large structure which has been partitioned there will always be some wellbehaved structure in one of the parts. This takes many forms. For example, colorings of the integers by finitely many colors must have long monochromatic arithmetic progressions (van der Waerden's theorem); and colorings of the edges of large graphs must have monochromatic subgraphs of a specified type (Ramsey's theorem). This book explores many of the basic results and variations of this theory. Since the first edition of this book there have been many advances in this field. In the second edition the authors update the exposition to reflect the current state of the art. They also include many pointers to modern results
35 editions published between 1980 and 2015 in English and Russian and held by 529 WorldCat member libraries worldwide
In every sufficiently large structure which has been partitioned there will always be some wellbehaved structure in one of the parts. This takes many forms. For example, colorings of the integers by finitely many colors must have long monochromatic arithmetic progressions (van der Waerden's theorem); and colorings of the edges of large graphs must have monochromatic subgraphs of a specified type (Ramsey's theorem). This book explores many of the basic results and variations of this theory. Since the first edition of this book there have been many advances in this field. In the second edition the authors update the exposition to reflect the current state of the art. They also include many pointers to modern results
Erdős on graphs : his legacy of unsolved problems by
Fan R. K Chung(
Book
)
15 editions published between 1998 and 1999 in English and held by 455 WorldCat member libraries worldwide
15 editions published between 1998 and 1999 in English and held by 455 WorldCat member libraries worldwide
The mathematics of Paul Erdös by
Ronald L Graham(
Book
)
30 editions published between 1996 and 2013 in English and held by 311 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (19131996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, more biographical information about Paul Erdős, and an updated list of publications. The first volume contains the unique chapter "Early Days", which features personal memories of Paul Erdős by a number of his colleagues. The other three chapters cover number theory, random methods, and geometry. All of these chapters are essentially updated, most notably the geometry chapter that covers the recent solution of the problem on the number of distinct distances in finite planar sets, which was the most popular of Erdős' favorite geometry problems
30 editions published between 1996 and 2013 in English and held by 311 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (19131996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collection. A unique contribution is the bibliography on Erdős' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdős' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, more biographical information about Paul Erdős, and an updated list of publications. The first volume contains the unique chapter "Early Days", which features personal memories of Paul Erdős by a number of his colleagues. The other three chapters cover number theory, random methods, and geometry. All of these chapters are essentially updated, most notably the geometry chapter that covers the recent solution of the problem on the number of distinct distances in finite planar sets, which was the most popular of Erdős' favorite geometry problems
Combinatorial mathematics : proceedings of the Third International Conference by
International Conference on Combinatorial Mathematics(
Book
)
14 editions published in 1989 in English and held by 252 WorldCat member libraries worldwide
14 editions published in 1989 in English and held by 252 WorldCat member libraries worldwide
Old and new problems and results in combinatorial number theory by
Paul Erdős(
Book
)
11 editions published in 1980 in English and Undetermined and held by 222 WorldCat member libraries worldwide
11 editions published in 1980 in English and Undetermined and held by 222 WorldCat member libraries worldwide
N is a number : a portrait of Paul Erdős by
George Paul Csicsery(
Visual
)
1 edition published in 2004 in English and held by 206 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland, and the United States over a period of four years presenting mathematician Paul Erdős's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
1 edition published in 2004 in English and held by 206 WorldCat member libraries worldwide
A documentary filmed in England, Hungary, Poland, and the United States over a period of four years presenting mathematician Paul Erdős's mathematical quest in its personal and philosophical dimensions, and the tragic historical events that molded his life
Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future : DIMATIADIMACS conference, May 1925,
1997, Štiřín Castle, Czech Republic by
Ronald L Graham(
Book
)
17 editions published between 1997 and 1999 in English and Undetermined and held by 154 WorldCat member libraries worldwide
Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curricula and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area. This volume offers a wellbalanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are
17 editions published between 1997 and 1999 in English and Undetermined and held by 154 WorldCat member libraries worldwide
Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curricula and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area. This volume offers a wellbalanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are
N is a number : a portrait of Paul Erdos(
Visual
)
1 edition published in 2014 in English and held by 130 WorldCat member libraries worldwide
A man with no home and no job, Paul Erdos was the most prolific mathematician who ever lived. Born in Hungary in 1913, Erdos wrote and coauthored over 1,500 papers and pioneered several fields in theoretical mathematics. At the age of 83 he still spent most of his time on the road, going from math meeting to math meeting, continually working on problems. He died on September 20, 1996 while attending such a meeting in Warsaw, Poland. N is a number: a portrait of Paul Erdos was filmed between 1988 and 1991. The film opens at Cambridge University's 1991 honorary doctorate ceremony, where Erdos received an award he says he would gladly trade for a "nice new proof." For Erdos, the meaning of life is "to prove and conjecture. "In an age dominated by technical wizardry and high tech communications, Erdos was an unusual human link connecting hundreds of people. As he traveled from country to country, Erdos carried with him the latest in mathematical thinking, inspiring others to develop new ideas and, sometimes, entire new fields. In turn, the mathematical community supported this repository of centuries of mathematical knowledge and lore. Every mathematician in the world has an "Erdos Number"the number of people he or she is removed from having coauthored a paper with Erdos. To pursue this life of wandering and pure scholarship, Erdos relied on a network of other renowned mathematiciansall of whom regarded him as an international treasure. Wherever he touched down, whether in Hungary, Australia or Kalamazoo, Erdos immediately began working on problems with his colleagues. They, in turn, took care of his everyday needs. Ronald Graham, director of the Mathematical Sciences Research Center at ATandT Laboratories, keeps an "Erdos Room" at his home in New Jersey. From here, Graham managed Erdos's financial affairs and coordinated his travels and lectures, trying to maintain a semblance of order in the life of a man who kept no bank accounts and gave money to anyone he felt needed it. In Cambridge, England, Bela Bollobas, an exErdos student, provided another oasis. As the film progresses it becomes clear that mathematicians around the world had more than a professional stake in caring for Erdos. In different ways, each of the many prominent mathematicians in the film expresses dedication to and love for Erdos. The structure of N is a Number is based on Erdos's 50 years of perpetual wandering, "like a bumblebee," carrying news and mathematical information from university to university. Erdos established himself as a serious mathematician at the age of 20 when he devised a more elegant proof for Chebyshev's theorem, i. e. , that there is always a prime number between any number and its double. He was at the center of an informal clique of gifted young mathematicians in Hungary, known as the Anonymous Group, because they would meet in a Budapest park under the statue of a medieval historian named Anonymous
1 edition published in 2014 in English and held by 130 WorldCat member libraries worldwide
A man with no home and no job, Paul Erdos was the most prolific mathematician who ever lived. Born in Hungary in 1913, Erdos wrote and coauthored over 1,500 papers and pioneered several fields in theoretical mathematics. At the age of 83 he still spent most of his time on the road, going from math meeting to math meeting, continually working on problems. He died on September 20, 1996 while attending such a meeting in Warsaw, Poland. N is a number: a portrait of Paul Erdos was filmed between 1988 and 1991. The film opens at Cambridge University's 1991 honorary doctorate ceremony, where Erdos received an award he says he would gladly trade for a "nice new proof." For Erdos, the meaning of life is "to prove and conjecture. "In an age dominated by technical wizardry and high tech communications, Erdos was an unusual human link connecting hundreds of people. As he traveled from country to country, Erdos carried with him the latest in mathematical thinking, inspiring others to develop new ideas and, sometimes, entire new fields. In turn, the mathematical community supported this repository of centuries of mathematical knowledge and lore. Every mathematician in the world has an "Erdos Number"the number of people he or she is removed from having coauthored a paper with Erdos. To pursue this life of wandering and pure scholarship, Erdos relied on a network of other renowned mathematiciansall of whom regarded him as an international treasure. Wherever he touched down, whether in Hungary, Australia or Kalamazoo, Erdos immediately began working on problems with his colleagues. They, in turn, took care of his everyday needs. Ronald Graham, director of the Mathematical Sciences Research Center at ATandT Laboratories, keeps an "Erdos Room" at his home in New Jersey. From here, Graham managed Erdos's financial affairs and coordinated his travels and lectures, trying to maintain a semblance of order in the life of a man who kept no bank accounts and gave money to anyone he felt needed it. In Cambridge, England, Bela Bollobas, an exErdos student, provided another oasis. As the film progresses it becomes clear that mathematicians around the world had more than a professional stake in caring for Erdos. In different ways, each of the many prominent mathematicians in the film expresses dedication to and love for Erdos. The structure of N is a Number is based on Erdos's 50 years of perpetual wandering, "like a bumblebee," carrying news and mathematical information from university to university. Erdos established himself as a serious mathematician at the age of 20 when he devised a more elegant proof for Chebyshev's theorem, i. e. , that there is always a prime number between any number and its double. He was at the center of an informal clique of gifted young mathematicians in Hungary, known as the Anonymous Group, because they would meet in a Budapest park under the statue of a medieval historian named Anonymous
Mathématiques concrètes : fondations pour l'informatique by
Ronald L Graham(
Book
)
7 editions published between 1997 and 2003 in French and held by 124 WorldCat member libraries worldwide
7 editions published between 1997 and 2003 in French and held by 124 WorldCat member libraries worldwide
Experimental validation of clock synchronization algorithms by
Daniel L Palumbo(
Book
)
6 editions published in 1992 in English and held by 104 WorldCat member libraries worldwide
6 editions published in 1992 in English and held by 104 WorldCat member libraries worldwide
Handbook of combinatorics(
Book
)
9 editions published in 1995 in English and held by 80 WorldCat member libraries worldwide
9 editions published in 1995 in English and held by 80 WorldCat member libraries worldwide
Combinatorial number theory : proceedings of the "Integers Conference 2005" in celebration of the 70th birthday of Ronald
Graham, Carrollton, Georgia, USA, October 2730, 2005 by
Bruce M Landman(
Book
)
5 editions published in 2007 in English and held by 71 WorldCat member libraries worldwide
Biographical note: B.M. Landman, University of West Georgia, USA; M.B. Nathanson, City University of New York, USA; J. Nešet?il, Charles University, Czech Republic; R.J. Nowakowski, Dalhousie University, Canada; C. Pomerance, Dartmouth College, USA
5 editions published in 2007 in English and held by 71 WorldCat member libraries worldwide
Biographical note: B.M. Landman, University of West Georgia, USA; M.B. Nathanson, City University of New York, USA; J. Nešet?il, Charles University, Czech Republic; R.J. Nowakowski, Dalhousie University, Canada; C. Pomerance, Dartmouth College, USA
The shortest network problem by
Ronald L Graham(
Visual
)
3 editions published between 1988 and 1989 in English and held by 65 WorldCat member libraries worldwide
Dr. Graham's lecture explores the Steiner problem which asks for the shortest network of line segments to interconnect a set of given points in the design of highway systems, oil pipelines, air conditioning systems and integrated circuits on silicon chips. Provides an introduction to NPcompleteness, a fundamental concept in theoretical computer science
3 editions published between 1988 and 1989 in English and held by 65 WorldCat member libraries worldwide
Dr. Graham's lecture explores the Steiner problem which asks for the shortest network of line segments to interconnect a set of given points in the design of highway systems, oil pipelines, air conditioning systems and integrated circuits on silicon chips. Provides an introduction to NPcompleteness, a fundamental concept in theoretical computer science
Handbook of combinatorics(
Book
)
9 editions published between 1995 and 2006 in English and held by 63 WorldCat member libraries worldwide
9 editions published between 1995 and 2006 in English and held by 63 WorldCat member libraries worldwide
Magical mathematics : the mathematical ideas that animate great magic tricks by
Persi Diaconis(
Book
)
11 editions published between 2011 and 2016 in English and held by 63 WorldCat member libraries worldwide
"Magical Mathematics reveals the secrets of amazing, funtoperform card tricksand the profound mathematical ideas behind themthat will astound even the most accomplished magician. Persi Diaconis and Ron Graham provide easy, stepbystep instructions for each trick, explaining how to set up the effect and offering tips on what to say and do while performing it. Each card trick introduces a new mathematical idea, and varying the tricks in turn takes readers to the very threshold of today's mathematical knowledge. For example, the Gilbreath principlea fantastic effect where the cards remain in control despite being shuffledis found to share an intimate connection with the Mandelbrot set. Other card tricks link to the mathematical secrets of combinatorics, graph theory, number theory, topology, the Riemann hypothesis, and even Fermat's last theorem. Diaconis and Graham are mathematicians as well as skilled performers with decades of professional experience between them. In this book they share a wealth of conjuring lore, including some closely guarded secrets of legendary magicians. Magical Mathematics covers the mathematics of juggling and shows how the I Ching connects to the history of probability and magic tricks both old and new. It tells the storiesand reveals the best tricksof the eccentric and brilliant inventors of mathematical magic. Magical Mathematics exposes old gambling secrets through the mathematics of shuffling cards, explains the classic streetgambling scam of threecard monte, traces the history of mathematical magic back to the thirteenth century and the oldest mathematical trickand much more"
11 editions published between 2011 and 2016 in English and held by 63 WorldCat member libraries worldwide
"Magical Mathematics reveals the secrets of amazing, funtoperform card tricksand the profound mathematical ideas behind themthat will astound even the most accomplished magician. Persi Diaconis and Ron Graham provide easy, stepbystep instructions for each trick, explaining how to set up the effect and offering tips on what to say and do while performing it. Each card trick introduces a new mathematical idea, and varying the tricks in turn takes readers to the very threshold of today's mathematical knowledge. For example, the Gilbreath principlea fantastic effect where the cards remain in control despite being shuffledis found to share an intimate connection with the Mandelbrot set. Other card tricks link to the mathematical secrets of combinatorics, graph theory, number theory, topology, the Riemann hypothesis, and even Fermat's last theorem. Diaconis and Graham are mathematicians as well as skilled performers with decades of professional experience between them. In this book they share a wealth of conjuring lore, including some closely guarded secrets of legendary magicians. Magical Mathematics covers the mathematics of juggling and shows how the I Ching connects to the history of probability and magic tricks both old and new. It tells the storiesand reveals the best tricksof the eccentric and brilliant inventors of mathematical magic. Magical Mathematics exposes old gambling secrets through the mathematics of shuffling cards, explains the classic streetgambling scam of threecard monte, traces the history of mathematical magic back to the thirteenth century and the oldest mathematical trickand much more"
The mathematics of Paul Erdös by
Ronald L Graham(
Book
)
23 editions published between 1996 and 2013 in English and held by 47 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdös, one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdös' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 900 pages, arranged into two volumes. These volumes contain both high level research articles as well as "key" articles which survey some of the cornerstones of Erdös' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdös complement this striking collection. A unique contribution is the bibliography on Erdös' publications: the most comprehensive ever published
23 editions published between 1996 and 2013 in English and held by 47 WorldCat member libraries worldwide
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdös, one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdös' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 900 pages, arranged into two volumes. These volumes contain both high level research articles as well as "key" articles which survey some of the cornerstones of Erdös' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdös complement this striking collection. A unique contribution is the bibliography on Erdös' publications: the most comprehensive ever published
Handbook of combinatorial optimization by
Dingzhu Du(
Book
)
9 editions published in 2013 in English and held by 20 WorldCat member libraries worldwide
The second edition of this 7volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multivolumework deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. Aninternational team of 3040 experts in the field form the editorial board. The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as nonspecialists will find the material stimulating and useful
9 editions published in 2013 in English and held by 20 WorldCat member libraries worldwide
The second edition of this 7volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multivolumework deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. Aninternational team of 3040 experts in the field form the editorial board. The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as nonspecialists will find the material stimulating and useful
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Knuth, Donald Ervin 1938
 Patashnik, Oren
 Erdős, Paul 19131996 Interviewee Author Dedicatee
 Nešetřil, Jaroslav Other Editor
 Spencer, Joel H. Author
 Diaconis, Persi Author
 Rothschild, Bruce L. 1941
 Butler, Steve Editor
 Grötschel, Martin Other Editor
 Lovász, László 1948 Other Editor
Useful Links
Associated Subjects
Asymptotic expansions Canada Card tricks Combinatorial analysis Combinatorial number theory Combinatorial optimization Computational complexity Computer programsValidation Computer programsVerification Computer science Computer scienceMathematics Discrete groups Distribution (Probability theory) Economics Electronic data processingDistributed processing Erdős, Paul, Geometry Graham, Ronald L., Graph theory Hoffman, Paul, Hungary Information theory Logic, Symbolic and mathematical Magic tricks Mathematical optimization Mathematical recreations Mathematicians Mathematics MathematicsPhilosophy NPcomplete problems Number theory Operations research Ramsey theory Random graphs Realtime data processing Scientists Statistics Steiner systems Synchronization United States
Alternative Names
Graham, R. 1935
Graham, R. L.
Graham, R. L. 1935
Graham, R. L. (Ronald L.), 1935
Graham, R. L. (Ronald Lewis), 1935
Graham, Roland L. 1935
Graham, Ron.
Graham, Ron 1935
Graham, Ron L. 1935
Graham, Ronald.
Graham, Ronald 1935
Graham, Ronald L.
Graham, Ronald L. 1935...
Graham, Ronald Lewis 1935
Grèchem, R.
Grechem, R. 1935
Lewis Graham Ronald
Ron Graham Amerikaans wiskundige
Ronald Graham amerikansk matematikar
Ronald Graham amerikansk matematiker
Ronald Graham amerykański metematyk
Ronald Graham matemático estadounidense (n. 1935)
Ronald Graham matematico statunitense
Ronald Graham mathématicien américain
Ronald Graham USamerikanischer Mathematiker
Грэхем, Р 1935
Роналд Грејам
Рональд Грехем
Рональд Грэм американский математик
רונלד גראהם
رونالد غراهام
رونالد قراهام
رونالد گراهام ریاضیدان آمریکایی
로널드 그레이엄
グラハム, ロナルド
グレアム, ロナルド・L
ロナルド・グラハム
葛立恆
Languages
Covers