Graham is Irwin and Joan Jacobs Professor in Computer Science and Engineering at the University of California, San Diego (UCSD). He also holds the title of Chief Scientist at the California Institute for Telecommunications and Information Technology. He received his Ph.D. in Mathematics from the University of California, Berkeley in 1962, and went into research in industry, working at Bell Labs and then AT&T Labs.

Graham is known for using the largest number in a real mathematical proof, which earned him a spot in the Guinness Book of World Records. The so-called Graham number, used as an upper bound in a proof in an area of mathematics known as Ramsey theory, has since been surpassed, but the Graham number is now part of the lore of mathematics. Graham also helped popularize the “Erdos number,” which is the minimum number of co-authored publications connecting directly to one with Erdos as an author. Although not a developed science, the Erdos number does seem to be an informal measurement of someone’s bona fides in mathematical and scientific publications. Graham participates in other “fun” activities outside of his serious work in mathematics—he is a trampolinist and juggler, for instance!

Graham has won many awards during his long career at AT&T Labs, including the American Mathematical Society’s Steele Prize for a lifetime of accomplishment. He is also Fellow of the ACM, and won the Polya Prize, as well as the Euler Prize, both awarded for top mathematical work.

**Featured in Top Influential Mathematicians Today**

According to Wikipedia, Ronald Lewis Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He was president of both the American Mathematical Society and the Mathematical Association of America, and his honors included the Leroy P. Steele Prize for lifetime achievement and election to the National Academy of Sciences.

- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey (5136)
- Concrete mathematics - a foundation for computer science (2427)
- Bounds on Multiprocessing Timing Anomalies (2271)
- An Efficient Algorithm for Determining the Convex Hull of a Finite Planar Set (1582)
- Bounds for certain multiprocessing anomalies (1510)
- Handbook of Combinatorics (1101)
- Concrete Mathematics, a Foundation for Computer Science (920)
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (848)
- On the History of the Minimum Spanning Tree Problem (724)
- Spearman's Footrule as a Measure of Disarray (584)
- The Complexity of Computing Steiner Minimal Trees (549)
- Concrete mathematics - a foundation for computer science (2. ed.) (485)
- Quasi-random graphs (446)
- The steiner problem in phylogeny is NP-complete (445)
- Some NP-complete geometric problems (382)
- Old and new problems and results in combinatorial number theory (366)
- On the addressing problem for loop switching (331)
- Resource Constrained Scheduling as Generalized Bin Packing (330)
- Optimal scheduling for two-processor systems (302)
- On Additive Bases and Harmonious Graphs (297)
- COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION (289)
- On a linear diophantine problem of Frobenius (256)
- Bounds for Multiprocessor Scheduling with Resource Constraints (249)
- Some intersection theorems for ordered sets and graphs (239)
- Lower bounds for constant weight codes (232)
- Ramsey’s theorem for $n$-parameter sets (226)
- The Number of Baxter Permutations (202)
- On the covering radius of codes (193)
- Dense packings of congruent circles in a circle (187)
- Distance Matrix Polynomials of Trees (178)
- Worst-case analysis of memory allocation algorithms (176)
- Paths, Flows, and VLSI-Layout (166)
- Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time (166)
- On embedding graphs in squashed cubes (162)
- Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions (154)
- Performance Guarantees for Scheduling Algorithms (151)
- Universal cycles for combinatorial structures (138)
- Apollonian circle packings:number theory (132)
- Ramsey's Theorem for a Class of Categories. (131)
- A constructive solution to a tournament problem (126)
- Bounds on multiprocessing anomalies and related packing algorithms (121)
- On isometric embeddings of graphs (118)
- Finding the Convex Hull of a Simple Polygon (110)
- The Shortest-Network Problem (106)
- Quasi-Random Hypergraphs (102)
- The Mathematics of Paul Erdős II (100)
- Euclidean Ramsey Theorems I (98)
- Rudiments of Ramsey theory (97)
- Ramsey theory (2nd ed.) (96)
- Quasi-random set systems (85)
- On sparse graphs with dense long paths. (85)
- On the distance matrix of a tree (84)
- Curved Hexagonal Packings of Equal Disks in a Circle (82)
- Edge-colored complete graphs with precisely colored subgraphs (81)
- On the Structure of t-Designs (80)
- Universal Single Transition Time Asynchronous State Assignments (79)
- Repeated Patterns of Dense Packings of Equal Disks in a Square (79)
- On the Cover Polynomial of a Digraph (78)
- Apollonian Circle Packings: Geometry and Group Theory I. The Apollonian Group (78)
- On Packing Squares with Equal Squares (76)
- Routing permutations on graphs via matchings (75)
- Highly irregular graphs (75)
- On the distance matrix of a directed graph (74)
- A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES (72)
- The Radon transform on $Z^k_2$. (71)
- Isometric embeddings of graphs. (70)
- On induced subgraphs of the cube (69)
- Sparse Quasi-Random Graphs (67)
- Graph Theory, Combinatorics, Algorithms, and Applications (65)
- Quasi-random subsets of Z n (65)
- Statistical Problems Involving Permutations With Restricted Positions (63)
- Random Walks Arising in Random Number Generation (61)
- On subsets of abelian groups with no 3-term arithmetic progression (61)
- Dense Packings of Equal Disks in an Equilateral Triangle: from 22 to 34 and Beyond (60)
- The Largest Small Hexagon (60)
- Covering the Positive Integers by Disjoint Sets of the Form {[n alpha + beta]: n = 1, 2, ...} (59)
- On Universal Graphs for Spanning Trees (59)
- Quasi-random tournaments (59)
- Improving Dense Packings of Equal Disks in a Square (59)
- Problem #7 (58)
- The Elementary Proof of the Prime Number Theorem (57)
- On edgewise 2-colored graphs with monochromatic triangles and containing no complete hexagon (57)
- Erdos on Graphs: His Legacy of Unsolved Problems (57)
- Steiner Trees for Ladders (57)
- On Multicolor Ramsey Numbers for Complete Bipartite Graphs (57)
- Penny-packing and two-dimensional codes (56)
- On the history of the Euclidean Steiner tree problem (56)
- Analysis of greedy approximations with nonsubmodular potential functions (54)
- Quantitative theorems for regular systems of equations (54)
- The effect of location and facility demand on the marginal cost of delivered wood chips from energy crops: a case study of the state of Tennessee (54)
- L worst-case performance bounds for rumple one-dimensional packing algorithms siam j (53)
- A Dynamic location problem for graphs (53)
- ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS (53)
- A short proof of van der Waerden’s theorem on arithmetic progressions (52)
- On the number of information symbols in difference-set cyclic codes (52)
- Performance bounds on the splitting algorithm for binary testing (52)
- On finite 0-simple semigroups and graph theory (51)
- Distance Realization Problems with Applications to Internet Tomography (50)
- On graphs with linear Ramsey numbers (49)
- Apollonian Circle Packings : Geometry and Group Theory (49)
- Handbook of combinatorics (vol. 1) (49)
- On graphs which contain all sparse graphs (48)
- Forced Convex n -Gons in the Plane (47)
- Information Bounds Are Weak in the Shortest Distance Problem (47)
- Balanced design of bootstrap simulations (46)
- A packing inequality for compact convex subsets of the plane (46)
- Apollonian Circle Packings: Geometry and Group Theory II. Super-Apollonian Group and Integral Packings (45)
- On graphs which contain all small trees (44)
- ON UNIVERSAL GRAPHS (44)
- Quasi-random graphs with given degree sequences (43)
- On Schur Properties of Random Subsets of Integers (42)
- Combinatorial designs related to the strong perfect graph conjecture (41)
- Increasing paths in edge ordered graphs (41)
- On cubical graphs (41)
- A Hadamard-Type Bound on the Coefficients of a Determinant of Polynomials (40)
- Apollonian Circle Packings: Geometry and Group Theory III. Higher Dimensions (39)
- A theorem on partitions (37)
- Minimum steiner trees in normed planes (36)
- Dynamic Search in Graphs (36)
- Combinatorial Designs Related to the Perfect Graph Conjecture (36)
- Spectra of Numbers (36)
- On Steiner trees for bounded point sets (36)
- Some Monotonicity Properties of Partial Orders (36)
- Recent trends in Euclidean Ramsey theory (36)
- On Bipartite Graphs with Linear Ramsey Numbers (36)
- Some Results on Matching in Bipartite Graphs (36)
- Some of My Favorite Problems in Ramsey Theory (34)
- The graph of generating sets of an abelian group (33)
- Combinatorics for the East Model (33)
- Cohomological aspects of hypergraphs (33)
- Guessing secrets (32)
- The Analysis of Sequential Experiments with Feedback to Subjects (32)
- On permutations containing no long arithmetic progressions (31)
- Steiner Trees on a Checkerboard (31)
- Linear Extensions of Partial Orders and the FKG Inequality (31)
- A whirlwind tour of computational geometry (30)
- Combinatorics: Recent results in graph decompositions (30)
- The Combinatorial Mathematics of Scheduling (29)
- Complete sequences of polynomial values (29)
- Restrictions of Minimum Spanner Problems (28)
- On the bases with an exact order (28)
- Monochromatic Equilateral Right Triangles on the Integer Grid (27)
- Anti-Hadamard matrices (27)
- Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines (27)
- Routing Permutations on Graphs Via Matchings (27)
- On the Fractional Covering Number of Hypergraphs (27)
- Bounds for arrays of dots with distinct slopes or lengths (26)
- Applications of the FKG Inequality and Its Relatives (25)
- Edge flipping in graphs (25)
- On Finite Sums of Unit Fractions (25)
- New bounds on a hypercube coloring problem (24)
- On the Set of Common Differences in van der Waerden's Theorem on Arithmetic Progressions (23)
- ON PROPERTIES OF A WELL‐KNOWN GRAPH OR WHAT IS YOUR RAMSEY NUMBER? (23)
- Worst case bounds for simple one-dimensional packing algorithms (23)
- The Elementary Proof of the Prime (23)
- A simpler counterexample to the Reconstruction Conjecture for denumerable graphs (23)
- Bounds on scheduling with limited resources (22)
- Magical Mathematics: The Mathematical Ideas That Animate Great Magic Tricks (22)
- Descent polynomials for permutations with bounded drop size (21)
- Random walks on generating sets for finite groups (21)
- Intersection Theorems for Vector Spaces (21)
- THE RADON TRANSFORM ON Z (21)
- On n-Valued Functionally Complete Truth Functions (21)
- Combinatorial Scheduling Theory (21)
- Maximal subsemigroups of finite semigroups (20)
- A Canonical Partition Theorem for Equivalence Relations on Zt (20)
- A Note on Irregularities of Distribution (20)
- Concrete Math (20)
- Quasi-random graphs with given degree sequences (20)
- Induced restricted Ramsey theorems for spaces (19)
- A Note on the Binomial Drop Polynomial of a Poset (19)
- Patterns and Structures in Disk Packings (19)
- An affine walk on the hypercube (19)
- On the improbability of reaching Byzantine agreements (19)
- Approximately optimal trees for group key management with batch updates (19)
- Complements and transitive closures (18)
- Primitive Juggling Sequences (18)
- ON THE GROWTH OF A VAN DER WAERDEN-LIKE FUNCTION (18)
- The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle (18)
- A Tribute to Paul Erdős: On graphs not containing prescribed induced subgraphs (18)
- Enumerating split-pair arrangements (18)
- Maximal antiramsey graphs and the strong chromatic number (17)
- Maximizing data locality in distributed systems (17)
- Are There n + 2 Points in E n With Odd Integral Distances? (17)
- Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future : DIMATIA-DIMACS conference, May 19-25, 1997, Štiřín Castle, Czech Republic (16)
- Quantitative Forms of a Theorem of Hilbert (16)
- On A Theorem of Uspensky (16)
- An Irreducibility Criterion for Polynomials Over the Integers (16)
- The tight lower bound for the Steiner ratio in Minkowski planes (16)
- Pursuit - Evasion games on graphs (16)
- On the prime factors of (²ⁿ_{}) (16)
- On graphs with linear Ramsey numbers (16)
- On finite sums of reciprocals of distinct $n$th powers. (16)
- On Partitions of En (15)
- Enumerating (Multiplex) Juggling Sequences (15)
- Finding Patterns Avoiding Many Monochromatic Constellations (15)
- Tiling rectangles with rectangles (14)
- A symmetrical Eulerian identity (14)
- A Note on the Intersection Properties of Subsets of Integers (14)
- Minimal decompositions of graphs into mutually isomorphic subgraphs (14)
- On irregularities of distribution of real sequences. (14)
- Euclidean Ramsey theorems on the n-sphere (14)
- On sampling with Markov chains (14)
- On the distrinution of $n\theta$ modulo 1 (13)
- Oblivious and Adaptive Strategies for the Majority and Plurality Problems (13)
- On the permanents of complements of the direct sum of identity matrices (13)
- Optimal Tree Structures for Group Key Management with Batch Updates (13)
- Single-processor scheduling with time restrictions (13)
- Minimum perimeter rectangles that enclose congruent non-overlapping circles (13)
- On Unimodality for Linear Extensions of Partial Orders (13)
- Fault-free Tilings of Rectangles (13)
- Pebbling a Chessboard (13)
- Combinatorics: Ancient and Modern (13)
- ON TIGHTEST PACKINGS IN THE MINKOWSKI PLANE (13)
- An Upper Bound on Minimum Distance for a k-ary Code (12)
- Pebbling a Chessboard (12)
- A Fibonacci-like Sequence of Composite Numbers (12)
- On the permanent of Schur's matrix (12)
- Lexicographic Ramsey Theory (12)
- Parking distributions on trees (12)
- Classes of interval graphs under expanding length restrictions (11)
- On partitions of (11)
- Parallelism versus memory allocation in pipelined router forwarding engines (10)
- Complete sequences of sets of integer powers (10)
- Ramsey's theorem for $n$-dimensional arrays (10)
- OLD AND NEW PROBLEMS AND RESULTS IN COMBINATORIAL NUMBER THEORY : van der WAERDEN'S THEOREM AND RELATED TOPICS (10)
- Combinatorial mathematics : proceedings of the third international conference (10)
- Note on a Nonlinear Recurrence Related to √2 (10)
- A tight lower bound for the Steiner ratio in Minkowski planes (10)
- Packing equal squares into a large square (10)
- Efficient realization techniques for network flow patterns (10)
- Guessing secrets with inner product questions (10)
- Addition chains with multiplicative cost (10)
- Dense Packings of Congruent Circles in Rectangles with a Variable Aspect Ratio (10)
- On quadruples of consecutive th power residues (9)
- The Solutions to Elmsley's Problem (9)
- Egyptian Fractions (9)
- Universal caterpillars (9)
- Irreducible Apollonian Configurations and Packings (9)
- The Sperner Capacity of Linear and Nonlinear Codes for the Cyclic Triangle (9)
- On extremal density theorems for linear forms (9)
- Generalized Eulerian sums (9)
- Generalized de Bruijn Cycles (9)
- Products of Universal Cycles (9)
- Topics in Euclidean Ramsey Theory (9)
- On a Diophantine Equation Arising in Graph Theory (8)
- On sparse sets hitting linear forms (8)
- On minimal colorings without monochromatic solutions to a linear equation (8)
- OLD AND NEW EUCLIDEAN RAMSEY THEOREMS (8)
- Oblivious and Adaptive Strategies for the Majority and Plurality Problems (8)
- Anarchy Is Free in Network Creation (8)
- ON PRODUCTS OF FACTORIALS BY (8)
- Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions (8)
- Stratified random walks on the n-cube (8)
- Tiling Polygons with Lattice Triangles (7)
- On partitions of an equilateral triangle (7)
- Inversion-descent polynomials for restricted permutations (7)
- Permanental generating functions and sequential importance sampling (7)
- Large minimal sets which force long arithmetic progressions (7)
- The Steiner ratio for the dual normed plane (7)
- The Radon transform on Abelian Groups (7)
- Iterated Triangle Partitions (7)
- Universal Juggling Cycles (7)
- ORIGAMI RINGS (7)
- Unseparated pairs and fixed points in random permutations (6)
- Quasi-Random Graphs (6)
- On the Prime Factors of \binom2nn (6)
- DEDICATED TO THE MEMORY OF THEODORE S. MOTZKIN (6)
- A parametric graphical display technique for on-line use (6)
- On the addressing problem for directed graphs (5)
- Guessing about Guessing: Practical Strategies for Card Guessing with Feedback (5)
- Irregularities in the distributions of finite sequences (5)
- ON THE PRODUCT OF THE POINT AND LINE COVERING NUMBERS OF A GRAPH (5)
- Combinatorial number theory : proceedings of the 'Integers Conference 2005' in celebration of the 70th birthday of Ronald Graham, Carrollton, Georgia, October 27-30, 2005 (5)
- On the Improbability of Reaching Byzantine Agreements (Preliminary Version) (5)
- Juggling card sequences (5)
- On hypergraphs having evenly distributed subhypergraphs (5)
- Experimental validation of clock synchronization algorithms (5)
- A COMBINATORIAL THEOREM FOR PARTIAL SUMS (5)
- Hypercube orientations with only two in-degrees (5)
- On Constant Weight Codes and Harmonious Graphs. (5)
- Edge flipping in the complete graph (5)
- Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5 (5)
- On partitions of a finite set (5)
- Iterated combinatorial density theorems (4)
- Efficient Packings of Unit Squares in a Large Square (4)
- Homogeneous Collinear Sets in Partitions of Zn (4)
- A note on marking lines in [k]n (4)
- New bounds on a hypercube coloring problem and linear codes (4)
- Card Guessing with Partial Feedback (4)
- Finding Favorites (4)
- On the Prime Factors of ( 2 n ) (3)
- 50 years of Combinatorics, Graph Theory, and Computing (3)
- Constructing Points through Folding and Intersection (3)
- A general Ramsey product theorem (3)
- Anarchy Is Free in Network Creation (3)
- Paul Erdős and Egyptian Fractions (3)
- On complete bipartite subgraphs contained in spanning tree complements (3)
- On a conjecture of Erdös in additive number theory (3)
- On the Prime Factors of ( 2 „ " ) (3)
- Quasi-random hypergraphs (3)
- On subgraph number independence in trees (3)
- Pursuit- Evasion Games (3)
- 12. The Magic of Charles Sanders Peirce (3)
- Slow Fibonacci Walks (3)
- On the discrepancy of circular sequences of reals (3)
- N T ] 1 7 O ct 2 00 3 Apollonian Circle Packings : Number Theory (3)
- Rudiments of Ramsey Theory: Second Edition (3)
- Subdivision by bisectors is dense in the space of all triangles (3)
- Ramsey Theory in the Work of Paul Erdős (3)
- The matrix cover polynomial (3)
- Proceedings of the third international conference on Combinatorial mathematics (3)
- How to play the Majority game with a liar (2)
- Collapsing numbers in bases 2, 3, and beyond (2)
- Optimal jumping patterns (2)
- Reflections on a Theme of Ulam (2)
- Note on a Nonlinear Recurrence Related to $\sqrt{2}$ (2)
- A Characterization of Deadlock Free Resource Contentions (2)
- The Solution of a Certain Recurrence (2)
- ON IRREGULARITIES OF DISTRIBUTION (2)
- De Bruijn Sequences with Varying Combs (2)
- Monochromatic lines in partitions of Zn (2)
- The drop polynomial of a weighted digraph (2)
- Dynamic location problems with limited look-ahead (2)
- On the decomposition of lattice-periodic functions (2)
- Spontaneous Patterns in Disk Packings (2)
- On the limit of a recurrence relation (2)
- Maximum antichains in the partition lattice (2)
- Monochromatic lines in partitions of Zn (2)
- How to Play the Majority Game with Liars (2)
- Monochromatic lines in partitions of Zn (2)
- Egyptian Fractions with Each Denominator Having Three Distinct Prime Divisors (1)
- Ramsey Properties of Families of Graphs (1)
- Commercially Viable Bus Services Are Encouraged by Legislation in N.S.W., Australia (1)
- Inserting Plus Signs and Adding (1)
- On the Bandwidths of a Graph and its Complement (1)
- On highly non-associative groupoids (1)
- Some Ramsey-type results for the n-cube (1)
- Nomination for Ronald L. Graham for Ams President (1)
- Subdivision Using Angle Bisectors Is Dense in the Space of Triangles (1)
- The Mathematics of the Flip and Horseshoe Shuffles (1)
- Comments on "On the covering radius of codes" [with reply] (1)
- Corrigendum to: “On isometric embeddings of graphs” [Trans. Amer. Math. Soc. 288 (1985), no. 2, 527–536; MR0776391 (86f:05055b)] (1)
- Approximately Optimal Trees for Group Key Management with Batch Updates (1)
- Corrigendum to "On Isometric Embeddings of Graphs" (1)
- Permutations Resilient to Deletions (1)
- Binomial coefficient codes over GF(2) (1)
- On subtrees of directed graphs with no path of length exceeding one. (1)
- Unrolling Residues to Avoid Progressions (1)
- Arithmetic progressions : from Hilbert to Shelah (1)
- Well dispersed sequences in [0,1]d (1)
- MINIMAL DECOMPOSITION OF ALL GRAPHS WITH EQUINUMEROUS VERTICES AND EDGES INTO MUTUALLY ISOMORPHIC SUBGRAPHS (1)
- A Remark on a Paper of Erdős and Nathanson (0)
- Chapter 4. Universal Cycles (0)
- Call Richard L.. A minimal canonically complete M-valuedproper logic for each M. The journal of symbolic logic, vol. 33 (1968), pp. 108–110. (0)
- LEVEL oc THE ANALYSIS OF SEQUENTIAL EXPERIMENTS WITH FEEDBACK TO SUBJECTS by Persi Diaconis (0)
- Combinatorial reconstruction theorems (0)
- About the Spencer (0)
- Report of the Session on Complexity of Combinatorial Problems (0)
- Review: F. Richard Singer, Some Sheffer Functions for $M$-Valued Logics (0)
- Exploration-production studies in newly drilled Devonian-shale gas wells. Annual technical report, February 1, 1987-January 31, 1988 (0)
- N T / 0 00 91 13 v 2 1 7 O ct 2 00 3 Apollonian Circle Packings : Number Theory (0)
- Graph Ramsey theory (0)
- Is Randomness Necessary (0)
- The theorems of Schur, Folkman, and Hindman (0)
- Quasi-Random Subsets of Integern (0)
- ORNL DAAC WebGIS: A Web-based GIS System for Visualizing and Distributing Biogeochemical and Ecological Datasets (0)
- Coloring, Packing, and Covering (0)
- Principles of Combinatorics (C. Berg) (0)
- Shuffling with ordered cards (0)
- Singer F. Richard. Some Sheffer functions for M-valued logics. Scripta mathematica, vol. 28 (1967), pp. 21–27. (0)
- PR ] 1 0 O ct 2 02 0 Card Guessing with Partial Feedback (0)
- Random Graphs and Graph Enumeration (0)
- The Hales-Jewett theorem (0)
- Jumping sequences (0)
- Research Courses Undergraduate Graduate News Resources People (0)
- Design and Analysis of Transient Fault Tolerance in SRAM with different NT Techniques (0)
- Chapter 3. Is This Stuff Actually Good for Anything (0)
- Quasi-Random Combinatorial Structures (Abstract) (0)
- Kirin Vladimir G.. On the polynomial representation of operators in the n-valued propositional calculus. Glasnik matematičko-fizički i astronomski (Periodicum mathematico-physicum et astronomicum), ser. 2 vol. 18 (1963), pp. 3–12. (0)
- Szemerédi’s theorem (0)
- Sum sequences modulo n (0)
- Chapter 9. What Goes Up Must Come Down (0)
- Rosenberg James. The application of ternary semigroups to the study of n-valued Sheffer functions. Notre Dame journal of formal logic , vol. 10 (1969), pp. 90–94. (0)
- Note Universal Caterpillars (0)
- Title Irreducible Apollonian Configurations and Packings Permalink (0)
- ’ llnlikelihood That Minimal Phylogenies fw a Realistic Biolegisal Study Can Be Constructed in Reasonable Computational fime (0)
- Partition and sum is fast (0)
- Universal structures Fan Chung cycles for combinatorial (0)
- Chapter 11. Going Further (0)
- Ramsey’s theorem (0)
- Chapter 1. Mathematics in the Air (0)
- An Asymptotic Result on a Zero of a Function (0)
- Erdős Stories as told by Andy Vázsonyi (0)
- Flipping edges and vertices in graphs (0)
- Note On Induced Subgraphs of the Cube (0)
- North-Holland 181 Binomial coefficient codes over W 2 ) (0)
- Universal SingleTransition TimeAsynchronous StateAssignments (0)
- Erratum: Quasi-random graphs with given degree sequences (0)
- Some Remarks on This Conference and Its Proceedings (0)
- Chapter 12. On Secrets (0)
- . Agency Use Onlyleave Blank 2. Report Date 3. Report Type and Dates Covered Experimental Validation of Clock Synchronization Algorithms (0)
- 2 Euclidean Ramsey Theory (0)
- N T ] 1 1 Se p 20 00 Apollonian Circle Packings : Number Theory (0)
- Erratum: Quasi-random graphs with given degree sequences (0)
- Combinatorial Problems Arising in Massive Data Sets (Abstract) (0)
- Chapter 8. Magic in the Book of Changes (0)
- Chapter 6. Neat Shuffles (0)
- Paperclip graphs (0)
- An interstice relationship for flowers with four petals (0)
- Extremal Graph Theory (0)
- Jumping Sequences Steve Butler (0)
- Three views of Ramsey theory (0)
- Preface to the John Selfridge Memorial Issue (0)
- Chapter 2. In cycles (0)
- Graceful configurations in the plane (0)
- Recovering permutations over a deletion channel (0)
- A Near-Optimal Algorithm for a Locality Maximising Placement Problem (0)
- Proceedings of the International Conference (3rd) on Combinatorial Mathematics Held in New York on 10-14 June 1985. (Annals of the New York Academy of Sciences. Volume 555) (0)
- Distance Matrices of Trees. (0)
- THE POSITIVE INTEGERS BY DISJOINT SETS (0)
- van der Waerden’s theorem (0)
- Preliminary ideas. Suppose G is an n-valued truth function of two variables p and q. We shall denote the truth table of G by the linear notation (0)
- Chapter 10. Stars of Mathematical Magic (And some of the best tricks in the book) (0)
- The 100th Birthday of Paul Erdős/Remembering Erdős (0)
- Review: James Rosenberg, The Application of Ternary Semigroups to the Study of $n$-Valued Sheffer Functions (0)
- Chapter 7. The Oldest Mathematical Entertainment (0)
- Chapter 5. From the Gilbreath Principle to the Mandelbrot Set (0)
- On the Distribution of Monochromatic Configurations (0)
- Review: Richard L. Call, A Minimal Canonically Complete M-Valued Proper Logic for Each M (0)
- Appendix a Proof of Theorem 3.1: We Represent the System by a Bipartite Graph Claim 4.2 Every D Gj 2 G Lled during the Rst Stage of a R Unites the Holes Existing in R into A (0)
- On the discrepancy of linear sequences of reals (0)
- Review: Vladimir G. Kirin, On the Polynomial Representation of Operators in the $n$-valued Propositional Calculus (0)
- 2] K. Simon, Finding a Minimal Transitive Reduction in a Strongly Connected Digraph With (0)
- Rado’s theorem (0)

This paper list is powered by the following services:

Ronald Graham is affiliated with the following schools:

This website uses cookies to enhance the user experience. Privacy Policy

Want to be an Academic Influence Insider?

Sign up to get the latest news, information, and rankings in our upcoming newsletter.