Discrete Mathematics, Volume 200

Volume 200, Numbers 1-3, April 1999

• Béla Bollobás, Paul Erdös, Amites Sarkar:
  Extremal graphs for weights. 5-19
  
• John Adrian Bondy, Paul Erdös, Siemion Fajtlowicz:
  Graphs of diameter two with no 4-circuits. 21-25
  
• Marc Deléglise, Paul Erdös, Jean-Louis Nicolas:
  Sur les ensembles représentés par les partitions d'un entier n¹. 27-48
  
• Jean-Marc Deshouillers, Paul Erdös, Giuseppe Melfi:
  On a question about sum-free sequences. 49-54
  
• 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. 55-60
  
• Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós:
  Induced subgraphs of given sizes. 61-77
  
• Paul Erdös, András Gyárfás:
  Split and balanced colorings of complete graphs. 79-86
  
• Paul Erdös, Richard Roxby Hall:
  On the angular distribution of Gaussian integers with fixed norm. 87-94
  
• Paul Erdös, Gergely Harcos, János Pach:
  Popular distances in 3-space. 95-99
  
• Paul Erdös, Grigori Kolesnik:
  Prime power divisors of binomial coefficients. 101-117
  
• Paul Erdös, Vsevolod F. Lev, Gerard Rauzy, Csaba Sándor, András Sárközy:
  Greedy algorithm, arithmetic progressions, subset sums and divisibility. 119-135
  
• Paul Erdös, Janice L. Malouf, J. L. Selfridge, Esther Szekeres:
  Subsets of an interval whose product is a power. 137-147
  
• Paul Erdös, Christian Mauduit, András Sárközy:
  On arithmetic properties of integers with missing digits II: Prime factors. 149-164
  
• Paul Erdös, Péter P. Pálfy:
  On the orders of directly indecomposable groups. 165-179
  
• Paul Erdös, Gerald Tenenbaum:
  Ensembles de multiples de suites finies. 181-203