The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Paul Erdös: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein
    Bounds on threshold dimension and disjoint threshold coverings (abstract only). [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1985, pp:422- [Conf]
  2. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:351-356 [Conf]
  3. Ron Aharoni, Paul Erdös, Nathan Linial
    Dual Integer Linear Programs and the Relationship between their Optima [Citation Graph (0, 0)][DBLP]
    STOC, 1985, pp:476-483 [Conf]
  4. Béla Bollobás, Paul Erdös
    Graphs of Extremal Weights. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1998, v:50, n:, pp:- [Journal]
  5. Paul Erdös, Hans Riesel
    On Admissible Constellations of Consecutive Primes. [Citation Graph (0, 0)][DBLP]
    BIT, 1988, v:28, n:3, pp:391-396 [Journal]
  6. Ron Aharoni, Paul Erdös, Nathan Linial
    Optima of dual integer linear programs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:13-20 [Journal]
  7. Miklós Ajtai, Paul Erdös, János Komlós, Endre Szemerédi
    On Turáns theorem for sparse graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:4, pp:313-317 [Journal]
  8. Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman
    Crossing Families. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1994, v:14, n:2, pp:127-134 [Journal]
  9. Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West
    Clique coverings of the edges of a random graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:1, pp:1-5 [Journal]
  10. D. de Caen, Paul Erdös, N. J. Pullmann, Nicholas C. Wormald
    Extremal clique coverings of complementary graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1986, v:6, n:4, pp:309-314 [Journal]
  11. Fan R. K. Chung, Paul Erdös
    On unavoidable graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:2, pp:167-176 [Journal]
  12. Fan R. K. Chung, Paul Erdös, Ronald L. Graham
    Minimal decompositions of graphs into mutually isomorphic subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:1, pp:13-24 [Journal]
  13. Mohamed M. El-Zahar, Paul Erdös
    On the existence of two non-neighboring subgraphs in a graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:295-300 [Journal]
  14. Paul Erdös
    On the combinatorial problems which I would most like to see solved. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:1, pp:25-42 [Journal]
  15. Paul Erdös
    Personal reminiscences and remarks on the mathematical work of Tibor Gallai. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:207-212 [Journal]
  16. Paul Erdös
    In memory of Tibor Gallai. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:4, pp:373-374 [Journal]
  17. Paul Erdös, Siemion Fajtlowicz
    On the conjecture of Hajós. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1981, v:1, n:2, pp:141-143 [Journal]
  18. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Multipartite graph - space graph Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:4, pp:311-318 [Journal]
  19. Paul Erdös, András Gyárfás
    A Variant of the Classical Ramsey Problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:4, pp:459-467 [Journal]
  20. Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein
    The size of chordal, interval and threshold subgraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:3, pp:245-253 [Journal]
  21. Paul Erdös, András Gyárfás, Miklós Ruszinkó
    How to decrease the diameter of triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:4, pp:493-501 [Journal]
  22. Paul Erdös, Ronald L. Graham, Imre Z. Ruzsa, Herbert Taylor
    Bounds for arrays of dots with distinct slopes or lengths. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1992, v:12, n:1, pp:39-44 [Journal]
  23. Paul Erdös, András Hajnal, Vera T. Sós, Endre Szemerédi
    More results on Ramsey - Turán Type problems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:69-81 [Journal]
  24. Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
    Turán-Ramsey theorems and simple asymptotically extremal structures. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:1, pp:31-56 [Journal]
  25. Paul Erdös, János Pach
    Variation on the theme of repeated distances. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:3, pp:261-269 [Journal]
  26. Paul Erdös, L. Bruce Richmond
    On graphical partitions. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:1, pp:57-63 [Journal]
  27. Paul Erdös, Miklós Simonovits
    Compactness results in extremal graph theory. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:275-288 [Journal]
  28. Paul Erdös, Vera T. Sós
    On Ramsey - Turán type theorems for hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:289-295 [Journal]
  29. Paul Erdös, Miklós Simonovits
    Supersaturated graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:2, pp:181-192 [Journal]
  30. Paul Erdös, Gábor N. Sárközy
    On cycles in the coprime graph of integers. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1997, v:4, n:2, pp:- [Journal]
  31. David Avis, Paul Erdös, János Pach
    Distinct Distances Determined By Subsets of a Point Set in Space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:1-11 [Journal]
  32. Paul Erdös, Peter C. Fishburn
    Minimum Planar Sets with Maximum Equidistance Counts. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:207-218 [Journal]
  33. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Ramsey Size Linear Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:389-399 [Journal]
  34. Paul Erdös, András Gyárfás, Tomasz Luczak
    Independet Transversals in Sparse Partite Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:293-296 [Journal]
  35. Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi
    Turán-Ramsey Theorems and Kp-Independence Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:297-325 [Journal]
  36. Paul Erdös, Endre Makai, János Pach
    Nearly Equal Distances in the Plane. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:401-408 [Journal]
  37. Paul Erdös, Edward T. Ordman, Yechezkel Zalcstein
    Clique Partitions of Chordal Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1993, v:2, n:, pp:409-415 [Journal]
  38. Paul Erdös, Peter C. Fishburn
    Multiplicities of Interpoint Distances in Finite Planar Sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:141-147 [Journal]
  39. Paul Erdös, Peter C. Fishburn
    Intervertex Distances in Convex Polygons. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:60, n:1-3, pp:149-158 [Journal]
  40. Noga Alon, Paul Erdös
    Disjoint Edges in Geometric Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:287-290 [Journal]
  41. Paul Erdös, Peter C. Fishburn
    A Postscript on Distances in Convex n-Gons. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:11, n:, pp:111-117 [Journal]
  42. Paul Erdös, Péter Komjáth
    Countable Decompositions of R2 and R3. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:325-331 [Journal]
  43. Paul Erdös, László Lovász, Katalin Vesztergombi
    On the Graph of Large Distance. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:541-549 [Journal]
  44. Paul Erdös, G. Purdy
    Two Combinatorial Problems in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:441-443 [Journal]
  45. Béla Bollobás, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Random induced graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:248, n:1-3, pp:249-254 [Journal]
  46. Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
    Edge disjoint monochromatic triangles in 2-colored graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:135-141 [Journal]
  47. Paul Erdös, Stephen T. Hedetniemi, Renu Laskar, Geert C. E. Prins
    On the equality of the partial Grundy and upper ochromatic numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:1, pp:53-64 [Journal]
  48. Paul Erdös, Daniel J. Kleitman
    Extremal problems among subsets of a set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:923-931 [Journal]
  49. Paul Erdös, A. Meir, Vera T. Sós, P. Turán
    On some applications of graph theory, I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:10-11, pp:853-866 [Journal]
  50. Paul Erdös, Guantao Chen, Cecil C. Rousseau, Richard H. Schelp
    Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:3, pp:183-189 [Journal]
  51. Paul Erdös, Zsolt Tuza, Pavel Valtr
    Ramsey-remainder. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:6, pp:519-532 [Journal]
  52. Andreas Blass, Paul Erdös, Alan D. Taylor
    Diverse Homogeneous Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:59, n:2, pp:312-317 [Journal]
  53. Tom C. Brown, Paul Erdös, Fan R. K. Chung, Ronald L. Graham
    Quantitative Forms of a Theorem of Hilbert. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:210-216 [Journal]
  54. Tom C. Brown, Paul Erdös, Allen R. Freedman
    Quasi-progressions and descending waves. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1990, v:53, n:1, pp:81-95 [Journal]
  55. M. Cates, Paul Erdös, N. Hindman, Bruce Rothschild
    Partition Theorems for Subsets of Vector Spaces. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1976, v:20, n:3, pp:279-291 [Journal]
  56. Guantao Chen, Paul Erdös, William Staton
    Proof of a Conjecture of Bollob's on Nested Cycles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:66, n:1, pp:38-43 [Journal]
  57. Fan R. K. Chung, Paul Erdös, Ronald L. Graham
    Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1982, v:32, n:2, pp:241-251 [Journal]
  58. Fan R. K. Chung, Paul Erdös, Joel H. Spencer
    Extremal subgraphs for two graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:38, n:3, pp:248-260 [Journal]
  59. Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer
    Intersection Statements for Systems of Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:1, pp:118-132 [Journal]
  60. Roger B. Eggleton, Paul Erdös, D. K. Skilton
    Colouring the real line. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1985, v:39, n:1, pp:86-100 [Journal]
  61. Paul Erdös
    Remark on a Theorem of Lindström. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1974, v:17, n:1, pp:129-130 [Journal]
  62. Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson
    Extremal Graphs for Intersecting Triangles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:1, pp:89-100 [Journal]
  63. Paul Erdös, Ralph J. Faudree, János Pach, Joel H. Spencer
    How to make a graph bipartite. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:45, n:1, pp:86-98 [Journal]
  64. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Graphs with certain families of spanning trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:32, n:2, pp:162-170 [Journal]
  65. Paul Erdös, Joel C. Fowler, Vera T. Sós, Richard M. Wilson
    On 2-Designs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:2, pp:131-142 [Journal]
  66. Paul Erdös, Ronald L. Graham
    On Packing Squares with Equal Squares. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1975, v:19, n:1, pp:119-123 [Journal]
  67. Paul Erdös, Ronald L. Graham, P. Montgomery, B. L. Rothschild, Joel Spencer, Ernst G. Straus
    Euclidean Ramsey Theorems I. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1973, v:14, n:3, pp:341-363 [Journal]
  68. Paul Erdös, András Gyárfás, László Pyber
    Vertex coverings by monochromatic cycles and trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1991, v:51, n:1, pp:90-95 [Journal]
  69. Paul Erdös, András Hajnal, Zsolt Tuza
    Local constraints ensuring small representing sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:78-84 [Journal]
  70. Paul Erdös, George Mills
    Some Bounds for the Ramsey-Paris-Harrington Numbers. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1981, v:30, n:1, pp:53-70 [Journal]
  71. Paul Erdös, G. Purdy
    Some Combinatorial Problems in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:25, n:2, pp:205-210 [Journal]
  72. Paul Erdös, János Pach, Richard Pollack, Zsolt Tuza
    Radius, diameter, and minimum degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:73-79 [Journal]
  73. Paul Erdös, J. L. Selfridge
    On a Combinatorial Game. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1973, v:14, n:3, pp:298-301 [Journal]
  74. Paul Erdös, Endre Szemerédi
    Combinatorial Properties of Systems of Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1978, v:24, n:3, pp:308-313 [Journal]
  75. Paul Erdös, Joel H. Spencer
    Monochromatic sumsets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1989, v:50, n:1, pp:162-163 [Journal]
  76. Paul Erdös, Michael E. Saks, Vera T. Sós
    Maximum induced trees in graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:41, n:1, pp:61-79 [Journal]
  77. Paul Erdös, Arthur M. Hobbs
    Hamiltonian cycles in regular graphs of moderate degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:1, pp:139-142 [Journal]
  78. D. T. Busolini, Paul Erdös
    On a problem in extremal graph theory. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:2-3, pp:251-254 [Journal]
  79. Paul Erdös, Robin J. Wilson
    On the chromatic index of almost all graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:2-3, pp:255-257 [Journal]
  80. Béla Bollobás, Paul Erdös
    On a Ramsey-Turán type problem. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1976, v:21, n:2, pp:166-168 [Journal]
  81. Paul Erdös, Mordechai Lewin
    d-complete sequences of integers. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1996, v:65, n:214, pp:837-840 [Journal]
  82. Paul Erdös, Israel Koren, Shlomo Moran, Gabriel M. Silberman, Shmuel Zaks
    Minimum-Diameter Cyclic Arrangements in Mapping Data-Flow Graphs onto VLSI Arrays. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1988, v:21, n:2, pp:85-98 [Journal]
  83. Richard A. Duke, Paul Erdös, Vojtech Rödl
    On large intersecting subfamilies of uniform setfamilies. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:4, pp:351-356 [Journal]
  84. Paul Erdös
    The Giant Component 1960-1993. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:3, pp:231-232 [Journal]
  85. Paul Erdös, Henry A. Kierstead, William T. Trotter
    The Dimension of Random Ordered Sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1991, v:2, n:3, pp:254-276 [Journal]
  86. Paul Erdös, Tomasz Luczak
    Change of Leadership in a Random Graph Process. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1994, v:5, n:1, pp:243-252 [Journal]
  87. Paul Erdös, Vojtech Rödl
    Covering of r-Graphs by Complete r-Partite Subgraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:319-322 [Journal]
  88. Paul Erdös, Stephen Suen, Peter Winkler
    On the Size of a Random Maximal Graph. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:309-318 [Journal]
  89. Paul Erdös, Prasad Tetali
    Representations of Integers as the Sum of k Terms. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:245-262 [Journal]
  90. László Babai, Paul Erdös, Stanley M. Selkow
    Random Graph Isomorphism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:3, pp:628-635 [Journal]
  91. Neil J. Calkin, Paul Erdös, Craig A. Tovey
    New Ramsey Bounds from Cyclic Graphs of Prime Order. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:381-387 [Journal]
  92. Paul Erdös, Peter C. Fishburn, Zoltán Füredi
    Midpoints of Diagonals of Convex n-GONS. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1991, v:4, n:3, pp:329-341 [Journal]
  93. Paul Erdös, D. Frank Hsu
    Distributed Loop Network with Minimum Transmission Delay. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:100, n:1, pp:223-241 [Journal]
  94. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Ramsey-minimal graphs for star-forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:33, n:3, pp:227-237 [Journal]
  95. Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Ramsey-minimal graphs for forests. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:38, n:1, pp:23-32 [Journal]
  96. Paul Erdös, G. Purdy, Ernst G. Straus
    On a problem in combinatorial geometry. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:40, n:1, pp:45-52 [Journal]
  97. Paul Erdös, Arthur M. Hobbs, C. Payan
    Disjoint cliques and disjoint maximal independent sets of vertices in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:42, n:1, pp:57-61 [Journal]
  98. Paul Erdös, András Hajnal
    Chromatic number of finite and infinite graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:53, n:, pp:281-285 [Journal]
  99. Paul Erdös, Douglas B. West
    A note on the interval number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:129-133 [Journal]
  100. Paul Erdös, Marcel Erné
    Clique numbers of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:3, pp:235-242 [Journal]
  101. Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
    Coloring graphs with locally few colors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:1-2, pp:21-34 [Journal]
  102. Paul Erdös
    On some metric and combinatorial geometric problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:147-153 [Journal]
  103. Paul Erdös, Nathan Linial, Shlomo Moran
    Extremal problems on permutations under cyclic equivalence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:1, pp:1-11 [Journal]
  104. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    A Ramsey problem of Harary on graphs with prescribed size. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:67, n:3, pp:227-233 [Journal]
  105. Paul Erdös, Zbigniew Palka
    Trees in random graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:46, n:2, pp:145-150 [Journal]
  106. Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson
    Finite linear spaces and projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:49-62 [Journal]
  107. Paul Erdös, Zbigniew Palka
    Addendum to "trees in random graphs". [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:2-3, pp:331- [Journal]
  108. Paul Erdös, N. Hindman
    Enumeration of intersecting families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:1, pp:61-65 [Journal]
  109. Paul Erdös
    Problems and results in combinatorial analysis and graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:81-92 [Journal]
  110. Paul Erdös, Ralph J. Faudree, Edward T. Ordman
    Clique partitions and clique coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:93-101 [Journal]
  111. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Extremal theory and bipartite graph-tree Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:103-112 [Journal]
  112. Paul Erdös, J. L. Nicolas, András Sárközy
    On the number of partitions of n without a given subsum (I). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:155-166 [Journal]
  113. Paul Erdös, András Hajnal
    On the number of distinct induced subgraphs of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:145-154 [Journal]
  114. Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós
    Induced subgraphs of given sizes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:61-77 [Journal]
  115. Paul Erdös, Grigori Kolesnik
    Prime power divisors of binomial coefficients. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:101-117 [Journal]
  116. Paul Erdös, Richard Roxby Hall
    On the angular distribution of Gaussian integers with fixed norm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:87-94 [Journal]
  117. Paul Erdös, András Gyárfás
    Split and balanced colorings of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:79-86 [Journal]
  118. Marc Deléglise, Paul Erdös, Jean-Louis Nicolas
    Sur les ensembles représentés par les partitions d'un entier n1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:27-48 [Journal]
  119. Paul Erdös, Christian Mauduit, András Sárközy
    On arithmetic properties of integers with missing digits II: Prime factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:149-164 [Journal]
  120. Paul Erdös, Janice L. Malouf, J. L. Selfridge, Esther Szekeres
    Subsets of an interval whose product is a power. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:137-147 [Journal]
  121. Paul Erdös, Gergely Harcos, János Pach
    Popular distances in 3-space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:95-99 [Journal]
  122. Béla Bollobás, Paul Erdös, Amites Sarkar
    Extremal graphs for weights. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:5-19 [Journal]
  123. Paul Erdös, Gerald Tenenbaum
    Ensembles de multiples de suites finies. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:181-203 [Journal]
  124. Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi
    On a question about sum-free sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:49-54 [Journal]
  125. John Adrian Bondy, Paul Erdös, Siemion Fajtlowicz
    Graphs of diameter two with no 4-circuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:21-25 [Journal]
  126. Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy
    Greedy algorithm, arithmetic progressions, subset sums and divisibility. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:119-135 [Journal]
  127. Paul Erdös, Péter P. Pálfy
    On the orders of directly indecomposable groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:165-179 [Journal]
  128. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    The number of cycle lengths in graphs of given minimum degree and girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:200, n:1-3, pp:55-60 [Journal]
  129. Paul Erdös, Peter C. Fishburn
    Distinct distances in finite planar sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:175, n:1-3, pp:97-132 [Journal]
  130. Paul Erdös, András Gyárfás, Yoshiharu Kohayakawa
    The size of the largest bipartite subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:267-271 [Journal]
  131. Paul Erdös
    Some recent problems and results in graph theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:164, n:1-3, pp:81-85 [Journal]
  132. Paul Erdös, László Pyber
    Covering a graph by complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:249-251 [Journal]
  133. Paul Erdös
    Some old and new problems in various branches of combinatorics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:227-231 [Journal]
  134. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    Subgraphs of minimal degree k. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:85, n:1, pp:53-58 [Journal]
  135. Paul Erdös, Fred Galvin
    Some Ramsey-type theorems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:3, pp:261-269 [Journal]
  136. Paul Erdös, Siemion Fajtlowicz, William Staton
    Degree sequences in triangle-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:92, n:1-3, pp:85-88 [Journal]
  137. Paul Erdös, Jean A. Larson
    Matchings from a set below to a set above. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:95, n:1-3, pp:169-182 [Journal]
  138. Paul Erdös, Zoltán Füredi, Zsolt Tuza
    Saturated r-uniform hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:2, pp:95-104 [Journal]
  139. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
    Extremal problems involving vertices and edges on odd cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:23-31 [Journal]
  140. Paul Erdös, András Sárközy
    Arithmetic progressions in subset sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:3, pp:249-264 [Journal]
  141. Richard A. Duke, Paul Erdös, Vojtech Rödl
    Cycle-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:261-278 [Journal]
  142. Paul Erdös, Tibor Gallai, Zsolt Tuza
    Covering the cliques of a graph with vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:279-289 [Journal]
  143. Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa
    The grid revisted. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:111, n:1-3, pp:189-196 [Journal]
  144. Paul Erdös, Fred Galvin
    Monochromatic infinite paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:59-70 [Journal]
  145. Paul Erdös, Cecil C. Rousseau
    The size Ramsey number of a complete bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:113, n:1-3, pp:259-262 [Journal]
  146. Paul Erdös, Ralph J. Faudree, Talmage James Reid, Richard H. Schelp, William Staton
    Degree sequence and independence in K(4)-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:141, n:1-3, pp:285-290 [Journal]
  147. Paul Erdös, Tibor Gallai, Zsolt Tuza
    Covering and independence in triangle structures. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:89-101 [Journal]
  148. Paul Erdös, András Gyárfás, Tomasz Luczak
    Graphs in which each C4 spans K4. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:154, n:1-3, pp:263-268 [Journal]
  149. Paul Erdös, Talmage James Reid, Richard H. Schelp, William Staton
    Sizes of graphs with induced subgraphs of large maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:158, n:1-3, pp:283-286 [Journal]
  150. Paul Erdös, Peter C. Fishburn
    Maximum planar sets that determine k distances. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:115-125 [Journal]
  151. Paul Erdös, András Sárközy, Vera T. Sós
    On additive properties of general sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:75-99 [Journal]
  152. Paul Erdös
    Problems and results in discrete mathematics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:136, n:1-3, pp:53-73 [Journal]
  153. Arie Bialostocki, Paul Erdös, Hanno Lefmann
    Monochromatic and zero-sum sets of nondecreasing diameter. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:137, n:1-3, pp:19-34 [Journal]
  154. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau
    Extremal problems and generalized degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:139-152 [Journal]
  155. Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp
    A local density condition for triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:127, n:1-3, pp:153-161 [Journal]

  156. Lopsided Lovász Local Lemma and Latin transversals. [Citation Graph (, )][DBLP]


  157. Ramsey-type theorems. [Citation Graph (, )][DBLP]


Search in 0.148secs, Finished in 0.153secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002