% ERDOS PUBLICATION LIST, UPDATE
% Updated September 30, 2010.
%
% Prepared by
%        Professor Jerrold W. Grossman 
%        Department of Mathematics and Statistics
%        Oakland University
%        Rochester, MI  48309-4485, USA
%
%  TELEPHONE:   (248) 370-3443
%  FAX:         (248) 370-4184
%  E-MAIL:      grossman@oakland.edu
%
% Please note various quirks about this file.  First -- the
% paper numbers, given in brackets after the macro "\paper" for 
% each entry, ARE OBSOLETE.  They are ignored by the macro, and
% the macro generates its own paper number.  Second --
% \frenchspacing is needed to keep correct spacing after periods
% throughout.  Third, some optional hyphens (\-) have been added
% to avoid overfull lines; they are harmless, of course.

%\magnification=833       % TURN THIS ON TO GET SMALLER FONT
 
\parindent 40pt
\baselineskip=10.5pt plus 0.3pt minus 0.1pt
\parskip 5pt plus 1pt minus 1pt
 
\frenchspacing

% macros for numbering the papers and adding review numbers
\newcount\papertotal\papertotal=0
\newcount\paperno
\newcount\yearno

\def\year#1\par{\bigskip\yearno=#1 \paperno=0}

\def\paper#1{\advance\paperno by1 \advance\papertotal by1
\item{\the\yearno.\ifnum \paperno<10 0\fi\the\paperno\hskip 2pt}}
% NOTE:  the number following "\paper" is obsolete

\def\mr#1.{; {\bf MR} #1.}
\def\cmp#1.{; {\bf CMP} #1.}
\def\Zbl{ {\bf Zbl.} }
\def\MATH{ {\bf MATH} }

\def\newa{{\bf ADDED IN 1/1997: }}
\def\newa{}
\def\newb{{\bf ADDED IN 1/1998: }}
\def\newb{}
\def\newc{{\bf ADDED IN 1/1999: }}
\def\newc{}
\def\newd{{\bf ADDED IN 1/2000: }}
\def\newd{}
\def\newe{{\bf ADDED IN 1/2001: }}
\def\newe{}
\def\newf{{\bf ADDED IN 1/2004: }}
\def\newf{}
\def\newg{{\bf ADDED IN 2006--7: }}
\def\newg{}
 
% Authors
 
\def\abbott{H. L. Abbott}
\def\aczel{J. Acz\'el}
\def\agoh{T. Agoh}
\def\aharoni{R. Aharoni}
\def\aigner{M. Aigner}
\def\ajtai{M. Ajtai}
\def\alaoglu{L. Ala\-oglu}
\def\alavi{Y. Alavi}
\def\alladi{K. Alladi}
\def\alon{N. Alon}
\def\jmanderson{J. M. Anderson}
\def\andrasfai{B. Andr\'asfai}
\def\ankeny{N. C. Ankeny}
\def\anning{N. H. Anning}
\def\arkin{J. Arkin}
\def\arney{D. C. Arney}
\def\aronov{B. Aronov}
\def\jmash{J. M. Ash}
\def\ashbacher{C. D. Ashbacher}
\def\davidavis{D. Avis}
\def\babai{L. Babai}
\def\babu{G. J. Babu}
\def\bagemihl{F. Bagemihl}
\def\balog{A. Balog}
\def\bankoff{L. Bankoff}
\def\barak{A. B. Barak}
\def\bateman{P. T. Bateman}
\def\baumg{J. E. Baumgartner}
\def\beasley{L. B. Beasley}
\def\beck{I. Beck}
\def\behzad{M. Behzad}
\def\bejlegaard{N. Bejlegaard}
\def\benkoski{S. J. Benkoski}
\def\bergel{V. Bergelson}
\def\berger{M. A. Berger}
\def\bertram{E. Bertram}
\def\bial{A. Bialostocki}
\def\blass{A. Blass}
\def\bleicher{M. N. Bleicher}
\def\bleck{R. Blecksmith}
\def\boals{A. J. Boals}
\def\boas{R. P. Boas, Jr.}
\def\boes{D. Boes}
\def\boll{B. Bollob\'as}
\def\bonar{D. D. Bonar}
\def\bondy{J. A. Bondy}
\def\bonnet{R. Bonnet}
\def\borosh{I. Borosh}
\def\bosak{J. Bos\'ak}
\def\bovey{J. D. Bovey}
\def\brenner{J. L. Brenner}
\def\brillh{J. Brillhart}
\def\brindza{B. Brindza}
\def\tcbrown{T. C. Brown}
\def\wgbrown{W. G. Brown}
\def\rcbuck{R. C. Buck}
\def\bukor{J. Bukor}
\def\burr{S. A. Burr}
\def\busolini{D. T. Busolini}
\def\caccetta{L. Caccetta}
\def\calkin{N. J. Calkin}
\def\cameron{P. J. Cameron}
\def\canfield{E. R. Canfield}
\def\carroll{F. W. Carroll}
\def\fscater{F. S. Cater}
\def\mlcates{M. L. Cates}
\def\catlin{P. A. Catlin}
\def\jhhchalk{J. H. H. Chalk}
\def\chartrand{G. Chartrand}
\def\ccchen{C. C. Chen}
\def\gchen{G. Chen}
\def\hchen{H. Chen}
\def\rwchen{R. W. Chen}
\def\chinn{P. Z. Chinn}
\def\choi{S. L. G. Choi}
\def\chowla{S. Chowla}
\def\chui{C. K. Chui}
\def\fanchung{F. R. K. Chung}
\def\klchung{K.-L. Chung}
\def\chvatal{V. Chv\'atal}
\def\bnclark{B. N. Clark}
\def\lhclark{L. H. Clark}
\def\clarkson{J. A. Clarkson}
\def\clunie{J. Clunie}
\def\sdcohen{S. D. Cohen}
\def\colbourn{C. J. Colbourn}
\def\jhconway{J. H. Conway}
\def\copeland{A. H. Copeland}
\def\htcroft{H. T. Croft}
\def\csaki{E. Cs\'aki}
\def\csiszar{I. Csisz\'ar}
\def\czipszer{J. Czipszer}
\def\darling{D. A. Darling}
\def\darst{R. Darst}
\def\davenport{H. Davenport}
\def\davies{R. O. Davies}
\def\daykin{D. E. Daykin}
\def\debruijn{N. G. de Bruijn}
\def\decaen{D. de Caen}
\def\dekoninck{J.-M. De Koninck}
\def\debose{Y. Debose}
\def\deheuv{P. Deheuvels}
\def\deleglise{M. Del\'eglise}
\def\denes{J. D\'enes}
\def\deshoul{J. M. Deshouillers}
\def\deuber{W. A. Deuber}
\def\deza{M. Deza}
\def\diaconis{P. Diaconis}
\def\hgdiam{H. G. Diamond}
\def\dirac{G. A. Dirac}
\def\dixmier{J. Dixmier}
\def\dowker{Y. N. Dowker}
\def\drake{D. A. Drake}
\def\dudley{U. Dudley}
\def\rduke{R. Duke}
\def\dvor{A. Dvoretzky}
\def\ecklund{E. F. Ecklund, Jr.}
\def\edrei{A. Edrei}
\def\eggle{R. B. Eggleton}
\def\elzahar{M. El-Zahar}
\def\elekes{G. Elekes}
\def\elliott{P. D. T. A. Elliott}
\def\entringer{R. Entringer}
\def\merne{M. Ern\'e}
\def\abevans{A. B. Evans}
\def\faber{V. Faber}
\def\fajt{S. Fajtlowicz}
\def\faud{R. J. Faudree}
\def\fejestoth{L. Fejes T\'oth}
\def\feldheim{E. Feldheim}
\def\feller{W. Feller}
\def\felz{A. Felzenbaum}
\def\lfew{L. Few}
\def\fishburn{P. C. Fishburn}
\def\fodor{G. Fodor}
\def\flaass{D. Fon Der Flaass}
\def\fowler{J. C. Fowler}
\def\tfowler{T. Fowler}
\def\fraenkl{A. S. Fraenkel}
\def\frankl{P. Frankl}
\def\freedman{A. R. Freedman}
\def\freiman{G. Freiman}
\def\gfreud{G. Freud}
\def\rfreud{R. Freud}
\def\efried{E. Fried}
\def\hfried{H. Fried}
\def\fuchs{W. H. J. Fuchs}
\def\furedi{Z. F\"uredi}
\def\isgal{I. S. G\'al}
\def\galambos{J. Galambos}
\def\gallai{T. Gallai}
\def\galvin{F. Galvin}
\def\gerencser{L. Gerencs\'er}
\def\jgillis{J. Gillis}
\def\lgillman{L. Gillman}
\def\gimbel{J. G. Gimbel}
\def\ginzburg{A. Ginzburg}
\def\goddard{W. Goddard}
\def\godsil{C. D. Godsil}
\def\mkgoldberg{M. K. Goldberg}
\def\golomb{M. Golomb}
\def\goodman{A. W. Goodman}
\def\bgordon{B. Gordon}
\def\gould{R. J. Gould}
\def\rlg{R. L. Graham}
\def\sid{S. W. Graham}
\def\granville{A. Granville}
\def\grieser{D. Grieser}
\def\kgrill{K. Grill}
\def\gruber{P. M. Gruber}
\def\grunbaum{B. Gr\"unbaum}
\def\grunwald{G. Gr\"unwald}
\def\gunder{D. S. Gunderson}
\def\hgupta{H. Gupta}
\def\mjtguy{M. J. T. Guy}
\def\rkguy{R. K. Guy}
\def\gyarfas{A. Gy\'arf\'as}
\def\gyori{E. Gy\H ori}
\def\gyory{K. Gy\H ory}
\def\hajnal{A. Hajnal}
\def\halasz{G. Hal\'asz}
\def\rrhall{R. R. Hall}
\def\hamburg{P. Hamburger}
\def\hammer{J. Hammer}
\def\hanani{H. Hanani}
\def\hanson{D. Hanson}
\def\harary{F. Harary}
\def\harcos{G. Harcos}
\def\gehardy{G. E. Hardy}
\def\wrhare{W. R. Hare}
\def\ccharner{C. C. Harner}
\def\hartman{S. Hartman}
\def\harrter{E. H\"artter}
\def\harzheim{E. Harzheim}
\def\hattingh{J. H. Hattingh}
\def\hechler{S. H. Hechler}
\def\hedet{S. T. Hedetniemi}
\def\hedrlin{Z. Hedrl\'\i n}
\def\hegyvari{N. Hegyv\'ari}
\def\heilbronn{H. Heilbronn}
\def\phell{P. Hell}
\def\hemminger{R. L. Hemminger}
\def\henning{M. A. Henning}
\def\henriksen{M. Henriksen}
\def\fherzog{F. Herzog}
\def\mherzog{M. Herzog}
\def\hicker{D. Hickerson}
\def\higgs{D. Higgs}
\def\hildebrand{A. Hildebrand}
\def\hindman{N. Hindman}
\def\hobbs{A. M. Hobbs}
\def\hoff{A. J. Hoffman}
\def\hoggatt{V. E. Hoggatt, Jr.}
\def\holton{D. A. Holton}
\def\holzman{R. Holzman}
\def\horak{P. Hor\'ak}
\def\horvath{M. Horv\'ath}
\def\howorka{E. Howorka}
\def\dfhsu{D. F. Hsu}
\def\gahunt{G. A. Hunt}
\def\hwang{J. S. Hwang}
\def\indle{K.-H. Indlekofer}
\def\ingham{A. E. Ingham}
\def\ivic{A. Ivi\'c}
\def\jabot{E. Jabotinsky}
\def\jackson{S. Jackson}
\def\jacobson{M. S. Jacobson}
\def\jagota{A. Jagota}
\def\janson{S. Janson}
\def\jarnik{V. Jarn\'\i k}
\def\gpjin{G. P. Jin}
\def\fjones{F. Jones}
\def\ijoo{I. Jo\'o}
\def\mjoo{M. Jo\'o}
\def\mkac{M. Kac}
\def\kainen{P. Kainen}
\def\kakutani{S. Kakutani}
\def\kaplansky{I. Kaplansky}
\def\karamata{J. Karamata}
\def\katai{I. K\'atai}
\def\zhaoke{Zhao Ke}
\def\pkelly{P. Kelly}
\def\kennedy{J. W. Kennedy}
\def\kestelman{H. Kestelman}
\def\khare{S. P. Khare}
\def\kierstead{H. A. Kierstead}
\def\pkiss{P. Kiss}
\def\klamkin{M. S. Klamkin}
\def\klawe{M. Klawe}
\def\kleit{D. J. Kleitman}
\def\klugerman{M. Klugerman}
\def\knapp{J. Knappenberger}
\def\koczy{L. A. K\'oczy}
\def\koha{Y. Kohayakawa}
\def\koksma{J. F. Koksma}
\def\kolesnik{G. Kolesnik}
\def\komjath{P. Komj\'ath}
\def\komlos{J. Koml\'os}
\def\komornik{V. Komornik}
\def\koren{I. Koren}
\def\kosto{A. V. Kostochka}
\def\kovari{T. K\H ov\'ari}
\def\krantz{S. G. Krantz}
\def\kratsch{D. Kratsch}
\def\krivel{M. Krivelevich}
\def\kroo{A. Kro\'o}
\def\kubicka{E. Kubicka}
\def\kubicki{G. Kubicki}
\def\kunen{K. Kunen}
\def\lacamp{C. B. Lacampagne}
\def\lam{P. C. B. Lam}
\def\larson{J. A. Larson}
\def\laskar{R. Laskar}
\def\lefmann{H. Lefmann}
\def\lehel{J. Lehel}
\def\lehner{J. Lehner}
\def\lengyel{B. A. Lengyel}
\def\lev{V. F. Lev}
\def\leveque{W. J. LeVeque}
\def\lewin{M. Lewin}
\def\winnie{W.-C. W. Li}
\def\drlick{D. R. Lick}
\def\linial{N. Linial}
\def\jqliu{J. Q. Liu}
\def\loebl{M. Loebl}
\def\lorentz{G. G. Lorentz}
\def\lov{L. Lov\'asz}
\def\loxton{J. H. Loxton}
\def\luca{F. Luca}
\def\luczak{T. \L uczak}
\def\macintyre{A. J. Macintyre}
\def\magidor{M. Magidor}
\def\kmahler{K. Mahler}
\def\maier{H. Maier}
\def\makai{E. Makai, Jr.}
\def\makkai{M. Makkai}
\def\malde{P. J. Malde}
\def\malouf{J. L. Malouf}
\def\marcus{S. Marcus}
\def\amate{A. M\'at\'e}
\def\maud{C. Mauduit}
\def\mauldin{R. D. Mauldin}
\def\maxsein{T. Maxsein}
\def\mays{M. E. Mays}
\def\mccanna{J. McCanna}
\def\mceliece{R. J. McEliece}
\def\mckay{B. D. McKay}
\def\melfi{G. Melfi}
\def\meir{A. Meir}
\def\meyer{A. G. Meyer}
\def\mills{G. Mills}
\def\milner{E. C. Milner}
\def\minc{H. Minc}
\def\mirsky{L. Mirsky}
\def\molloy{M. S. O. Molloy}
\def\hugh{H. L. Montgomery}
\def\montgom{P. Montgomery}
\def\jwmoon{J. W. Moon}
\def\moran{S. Moran}
\def\morton{P. Morton}
\def\lmoser{L. Moser}
\def\mullin{R. C. Mullin}
\def\mrmurty{M. Ram Murty}
\def\vkmurty{V. Kumar Murty}
\def\nath{M. B. Nathanson}
\def\nese{J. Ne\v set\v ril}
\def\netanyahu{E. Netanyahu}
\def\neveu{J. Neveu}
\def\newman{D. J. Newman}
\def\pney{P. Ney}
\def\nico{J.-L. Nicolas}
\def\niven{I. Niven}
\def\danorton{D. A. Norton}
\def\oneil{P. E. O'Neil}
\def\oblath{R. Obl\'ath}
\def\odl{A. M. Odlyzko}
\def\oel{O. R. Oellermann}
\def\offord{A. C. Offord}
\def\ordman{E. T. Ordman}
\def\oxtoby{J. C. Oxtoby}
\def\pach{J. Pach}
\def\palfy{P. P. P\'alfy}
\def\palka{Z. Palka}
\def\palmer{E. M. Palmer}
\def\zpapp{Z. Papp}
\def\parsons{T. Parsons}
\def\payan{C. Payan}
\def\penney{D. E. Penney}
\def\phelps{K. T. Phelps}
\def\pinkus{A. Pinkus}
\def\pippert{R. E. Pippert}
\def\piran{G. Piranian}
\def\pollack{R. Pollack}
\def\pollard{H. Pollard}
\def\pomer{C. Pomerance}
\def\posa{L. P\'osa}
\def\prachar{K. Prachar}
\def\preiss{D. Preiss}
\def\prins{G. Prins}
\def\pudaite{P. Pudaite}
\def\pullman{N. J. Pullman}
\def\purdy{G. B. Purdy}
\def\pyber{L. Pyber}
\def\rado{R. Rado}
\def\ramachandra{K. Ramachandra}
\def\sbrao{S. B. Rao}
\def\rauzy{G. Rauzy}
\def\reddy{A. R. Reddy}
\def\reid{T. J. Reid}
\def\renyi{A. R\'enyi}
\def\revesz{P. R\'ev\'esz}
\def\reznick{B. Reznick}
\def\irichards{I. Richards}
\def\richmond{L. B. Richmond}
\def\rieger{G. J. Rieger}
\def\riesel{H. Riesel}
\def\robinson{R. W. Robinson}
\def\rodl{V. R\"odl}
\def\carogers{C. A. Rogers}
\def\rosa{A. Rosa}
\def\rosenbloom{P. C. Rosenbloom}
\def\rosenfeld{M. Rosenfeld}
\def\rothschild{B. L. Rothschild}
\def\rous{C. C. Rousseau}
\def\rubel{L. A. Rubel}
\def\alrubin{A. L. Rubin}
\def\rudin{M. E. Rudin}
\def\ruzsa{I. Z. Ruzsa}
\def\ruszinko{M. Ruszink\'o}
\def\ryavec{C. Ryavec}
\def\hsachs{H. Sachs}
\def\saffari{B. Saffari}
\def\saias{\'E. Saias}
\def\saks{M. Saks}
\def\salamon{P. Salamon}
\def\salat{T. Sal\'at}
\def\sandor{C. S\'andor}
\def\sarkar{A. Sarkar}
\def\sark{A. S\'ark\"ozy}
\def\gsark{G. N. S\'ark\"ozy}
\def\sauer{N. Sauer}
\def\schaer{J. Schaer}
\def\schelp{R. H. Schelp}
\def\scherk{P. Scherk}
\def\schinzel{A. Schinzel}
\def\schmutz{E. Schmutz}
\def\schnitz{F. J. Schnitzer}
\def\schonheim{J. Sch\"onheim}
\def\schulman{L. J. Schulman}
\def\schuster{S. Schuster}
\def\schwenk{A. J. Schwenk}
\def\segal{S. L. Segal}
\def\seidel{W. Seidel}
%\def\selberg{A. Selberg}
\def\selfr{J. L. Selfridge}
\def\selkow{S. M. Selkow}
\def\seress{\'A. Seress}
\def\shallit{J. O. Shallit}
\def\hnshapiro{H. N. Shapiro}
\def\hsshapiro{H. S. Shapiro}
\def\sharma{A. Sharma}
\def\shelah{S. Shelah}
\def\sheng{T. K. Sheng}
\def\shields{A. L. Shields}
\def\shisha{O. Shisha}
\def\shorey{T. N. Shorey}
\def\shreve{W. E. Shreve}
\def\silberman{G. M. Silberman}
\def\rsilverman{R. Silverman}
\def\simmons{A. Simmons}
\def\simon{M. Simono\-vits}
\def\singhi{N. M. Singhi}
\def\siran{J. \v{S}\'{\i}r\'{a}\v{n}}
\def\sirao{T. Sirao}
\def\skilt{D. K. Skilton}
\def\bsmith{B. Smith}
\def\prsmith{P. R. Smith}
\def\soifer{A. Soifer}
\def\sos{V. T. S\'os}
\def\specker{E. Specker}
\def\spenc{J. H. Spencer}
\def\spiro{C. A. Spiro-Silverman}
\def\staton{W. Staton}
\def\astein{A. Stein}
\def\sstein{S. Stein}
\def\stewart{C. L. Stewart}
\def\stinson{D. Stinson}
\def\ahstone{A. H. Stone}
\def\hjstraight{H. J. Straight}
\def\straus{E. G. Straus}
\def\subbarao{M. V. Subbarao}
\def\suen{S. Suen}
\def\hcsun{H. C. Sun}
\def\suranyi{J. Sur\'anyi}
\def\swart{H. C. Swart}
\def\szab{J. Szabados}
\def\szal{M. Szalay}
\def\szegedy{M. Szegedy}
\def\szego{G. Szeg\H o}
\def\szekely{L. A. Sz\'ekely}
\def\eszek{E. Szekeres}
\def\szekeres{G. Szekeres}
\def\szem{E. Szemer\'edi}
\def\szusz{P. Sz\"usz}
\def\tarski{A. Tarski}
\def\ataylor{A. Taylor}
\def\htaylor{H. Taylor}
\def\sjtaylor{S. J. Taylor}
\def\tenen{G. Tenenbaum}
\def\tetal{P. Tetali}
\def\cthomassen{C. Thomassen}
\def\tijd{R. Tijdeman}
\def\toth{J. T. T\'oth}
\def\totik{V. Totik}
\def\tovey{C. A. Tovey}
\def\trotter{W. T. Trotter, Jr.}
\def\turan{P. Tur\'an}
\def\turk{J. Turk}
\def\tutte{W. T. Tutte}
\def\tuza{Zs. Tuza}
\def\ulam{S. Ulam}
\def\urbanik{K. Urbanik}
\def\vaaler{J. D. Vaaler}
\def\valtr{P. Valtr}
%\def\vandercorput{J. G. van der Corput}
\def\vankampen{E. R. van Kampen}
\def\vanlint{J. H. van Lint, Jr.}
\def\varma{A. K. Varma}
\def\vaughan{R. C. Vaughan}
\def\vazson{E. V\'azsonyi}
\def\verte{P. V\'ertesi}
\def\veszt{K. Vesztergombi}
\def\vijayan{K. Vijayan}
\def\vincze{I. Vincze}
\def\volkmann{B. Volkmann}
\def\wagstaff{S. S. Wagstaff, Jr.}
\def\wang{J. Wang}
\def\weakley{W. D. Weakley}
\def\gweiss{G. Weiss}
\def\dbwest{D. B. West}
\def\williamson{A. G. Williamson}
\def\rmwilson{R. M. Wilson}
\def\rjwilson{R. J. Wilson}
\def\winkler{P. M. Winkler}
\def\wintner{A. Wintner}
\def\wormald{N. C. Wormald}
\def\ffyao{F. F. Yao}
\def\azaks{A. Zaks}
\def\szaks{S. Zaks}
\def\zalc{Y. Zalcstein}
\def\zaremba{S. K. Zaremba}
\def\zhang{Z. X. Zhang}
\def\aziv{A. Ziv}

% Journals

\def\mta{Magyar Tud. Akad. Mat. Kutat\'o Int.  K\"ozl.}
\def\Procc{Nederl. Akad. Wetensch. Proc. Ser. A.}

%  WORKING TITLE:

\centerline {\bf LIST OF PUBLICATIONS OF PAUL ERD\H OS: UPDATE,
September, 2010}
\medskip

% INTRODUCTION:  (This must be included.)

{
 
\baselineskip 12pt
\parskip=0pt
 
\noindent This update contains corrections and additions to the
bibliography of Paul Erd\H os's publications appearing in {\it The
Mathematics of Paul Erd\H os\/}, R. L. Graham and \nese, eds.,
Volume II, pp.~477--573 (Springer, 1997). Years prior to 1991 are
shown here by correction only. From 1991 onward, complete lists are
given. (The final count at the end of this list includes all
publications.) This file is
posted on the World Wide Web site of the Erd\H os Number Project:
{\tt http://www.oakland.edu/enp} and is
updated every few years.
\medskip

Generally, the bibliographic style of {\it Mathematical Reviews\/}
has been followed, at least approximately. Coauthor names, if any,
are given in parentheses near the end of each entry. The {\it
Mathematical Reviews\/} review number ({\bf MR}) is included with
each item for which it exists; otherwise, the {\it Current
Mathematical Publications} control number ({\bf CMP}) is included
when it exists. Similarly, the {\bf Zbl} numbers are provided where
possible. This list incorporates corrections of some errors and
omissions that appeared in the previous Erd\H os bibliography,
which was prepared by Dezs\H{o} Mikl\'os in {\it Combinatorics, Paul
Erd\H os is Eighty, Volume 1, Bolyai Society Mathematical Studies},
pp.~471--527, J\'anos Bolyai Mathematical Society, Budapest, 1993
(for example, the omission of Tur\'an as a coauthor of the last
paper listed for 1935). In some cases items have been shifted to a
different year to reflect more accurately the actual publication
date. Items have necessarily been renumbered in order to maintain a
year-by-year list, alphabetical by title. {\it Please send further
additions or corrections to\/ {\tt grossman@oakland.edu}.}
 
}

% ACTUAL LIST STARTS HERE 

\year 1934

\advance\paperno by1
 
\paper{34.02} Bizonyos sz\'amtani sorok t\"orzssz\'amair\'ol (On
primes in some arithmetic progressions, in Hungarian), {\it
B\"olcs\'eszdoktori \'ertekez\'es}, S\'arospatak, 1934, 1--20.

\bigskip
\item{}
NOTE: The following book, which Paul Erd\H os co-edited
with G.~Katona, was not included in the original list for 1968, nor
is it included in the count of publications:
\item{}{\it Theory of graphs (Proc. Colloq., Tihany, 1966)},
Academic Press, New York, 1968\mr38\#1016.

\year 1972
 
\advance\paperno by 10
 
\paper{72.11} On some applications of graph theory, I., {\it
Discrete Math.} {\bf 2} (1972) no.~3, 207--228 (\meir; \sos;
\turan)\mr46\#5053;\Zbl 236.05119. [Republished in 
{\it
Discrete Math.} {\bf 306} (2006)  no.~10--11, 853--866;\Zbl
1095.05037.]

\year 1974
 
\advance\paperno by 8


 
\paper{74.09} Extremal problems among subsets of a set, {\it
Discrete Math.} {\bf 8} (1974), 281--294 (\kleit)\mr48\#10821;\Zbl
281.04002. [Republished in 
{\it
Discrete Math.} {\bf 306} (2006)  no.~10--11, 923--931;\Zbl
pre05044119 .]
 
\advance\paperno by 14

\paper{74.23a} On the scarcity of simple groups, {\it Science and
Human Progress, Prof. D. D. Kosambi Commemoration Volume\/},
pp.~229--232, Popular Prakashan, Bombay, 1974.

\year 1988

\advance\paperno by 4

\paper{88.04a}\newb Commentary, {\it I. J. Schoenberg Selected
Papers}, Vol.~1, pp.~67--68, Birkh\"auser Boston, Boston,
1988\mr91c:01051a (for entire book).

\advance\paperno by 19
 
\paper{88.24} Optima of dual integer linear programs, {\it
Combinatorica} {\bf 8} (1988) no.~1, 13--20 [also appeared as
``Dual integer linear programs and the relationship between their
optima'' in {\it Proceedings of the Seventeenth Annual ACM
Symposium on Theory of Computing (STOC)\/}, 1985, 476--483]
(\aharoni;
\linial)\mr89f:90093;\Zbl 648.90054.

\year 1990

\advance\paperno by 31
 
\paper{90.32} The distribution of values of a certain class of
arithmetic functions at consecutive integers, {\it Number theory,
Vol.~I (Budapest, 1987), Colloq. Math. Soc. J\'anos Bolyai, 51},
pp.~45--91, North-Holland, Amsterdam, 1990 (\ivic)\mr91f:11068;\Zbl
704.11032.

\papertotal=1268

\year 1991
 
\paper{91.01} A note on the largest $H$-free subgraph in a random
graph, {\it Graph theory, combinatorics and applications, Vol. 1
(Kalamazoo, MI, 1988), Wiley-Intersci. Publ.}, pp.~435--437, Wiley,
New York, 1991 (\gimbel)\mr93d:05137;\Zbl 840.05085.
 
\paper{91.02} Absorbing common subgraphs, {\it Graph theory,
combinatorics, algorithms, and applications (San Francisco, CA,
1989)}, pp.~96--105, SIAM, Philadelphia, PA, 1991 (\chartrand;
\kubicki)\mr92i:05169;\Zbl 751.05070.
 
\paper{91.03} Carmichael's lambda function, {\it Acta Arith.} {\bf
58} (1991) no.~4, 363--385 (\pomer; \schmutz)\mr92g:11093;\Zbl
734.11047.
 
\paper{91.04} Degree sequences in triangle-free graphs, {\it
Discrete Math.} {\bf 92} (1991) no.~1--3, 85--88 (\fajt;
\staton)\mr92m:05080;\Zbl 752.05028.

\paper{91.04a}\newa Distances determined by $n$ points in the plane,
{\it Geombinatorics} {\bf 1} (1991) no.~2, 3--4\cmp1 208 430;\Zbl
850.52005.
 
\paper{91.05} Distances in convex polygons, {\it Geombinatorics}
{\bf 1} (1991) no.~3, 4\cmp1 208 435;\Zbl 843.52011.
 
\paper{91.06} Distinct distances determined by subsets of a point
set in space, {\it Comput. Geom.} {\bf 1} (1991)  no.~1, 1--11
(\davidavis; \pach)\mr92m:52038;\Zbl 732.52004.
 
\paper{91.07} Double vertex graphs, {\it J. Combin. Inform. System
Sci.} {\bf 16} (1991) no.~1, 37--50 (\alavi; \behzad;
\drlick)\mr93d:05126;\Zbl 764.05077.
 
\paper{91.08} Edge conditions for the existence of minimal degree
subgraphs, {\it Graph theory, combinatorics and applications, Vol. 1
(Kalamazoo, MI, 1988), Wiley-Intersci. Publ.}, pp.~419--434, Wiley,
New York, 1991 (\faud; \rous; \schelp)\mr93c:05062;\Zbl 830.05033.
 
\paper{91.09} Existence of complementary graphs having specified
edge domination numbers, {\it J. Combin. Inform. System Sci.} {\bf
16} (1991) no.~1, 7--10 (\schuster)\mr93d:05068;\Zbl 767.05089.
 
\paper{91.10} Extremal non-Ramsey graphs, {\it Graph theory,
combinatorics, algorithms, and applications (San Francisco, 1989)},
pp.~42--66, SIAM, Philadelphia, PA, 1991 (\burr)\mr93b:05118;\Zbl
745.05043.
 
\paper{91.11} Extremal problems for cycle-connected graphs,
Proceedings of the Twenty-second Southeastern Conference on
Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1991),
{\it Congr. Numer.} {\bf 83} (1991), 147--151 (\rduke;
\rodl)\mr93a:05073;\Zbl 772.05052.
 
\paper{91.12} Further results on maximal anti-Ramsey graphs, {\it
Graph theory, combinatorics and applications, Vol. 1 (Kalamazoo, MI,
1988), Wiley-Intersci. Publ.}, pp.~193--206, Wiley, New York, 1991
(\burr; \sos; \frankl; \rlg)\mr93i:05093;\Zbl 840.05061.
 
\paper{91.13} Gaps in difference sets, and the graph of nearly equal
distances, {\it Applied geometry and discrete mathematics, DIMACS
Ser. Discrete Math. Theoret. Comput. Sci., 4}, pp.~265--273, Amer.
Math. Soc., Providence, RI, 1991 (\makai; \pach;
\spenc)\mr92i:52021;\Zbl 741.52010.
 
\paper{91.14} Graphs realizing the same degree sequences and their
respective clique numbers, {\it Graph theory, combinatorics and
applications, Vol. 1 (Kalamazoo, MI, 1988), Wiley-Intersci. Publ.},
pp.~439--449, Wiley, New York, 1991 (\jacobson;
\lehel)\mr93d:05149;\Zbl 840.05093.
 
\paper{91.15} Introduction to {\it Geometric etudes in combinatorial
mathematics} by Vladimir Boltyanskij and Alex\-ander Soifer, Center
for Excellence in Mathematical Education, Colorado Springs, CO,
1991\mr 92f:\-52031 (for entire book);\Zbl 727.52001 (for entire
book).
 
\paper{91.16} Local constraints ensuring small representing sets,
{\it J. Combin. Theory Ser. A} {\bf 58} (1991) no.~1, 78--84
(\hajnal; \tuza)\mr92k:05128;\Zbl 728.05059.
 
\paper{91.17} Lopsided Lov\'asz local lemma and Latin transversals,
ARIDAM III (New Brunswick, NJ, 1988), {\it Discrete Appl. Math.}
{\bf 30} (1991) no.~2--3, 151--154 (\spenc)\mr92c:05160;\Zbl
717.05017.
 
\paper{91.18} Matchings from a set below to a set above, Directions
in infinite graph theory and combinatorics (Cambridge, 1989), {\it
Discrete Math.} {\bf 95} (1991) no.~1--3, 169--182
(\larson)\mr93a:04001;\Zbl 761.04003.
 
\paper{91.19} Midpoints of diagonals of convex $n$-gons, {\it SIAM
J. Discrete Math.} {\bf 4} (1991) no.~3, 329--341 (\fishburn;
\furedi)\mr92f:52032;\Zbl 737.52006.
 
\paper{91.20} New bounds on the length of finite Pierce and Engel
series, {\it S\'em. Th\'eor. Nombres Bordeaux (2)} {\bf 3} (1991)
no.~1, 43--53 (\shallit)\mr92f:11016;\Zbl 727.11003.
 
\paper{91.21} Odd cycles in graphs of given minimum degree, {\it
Graph theory, combinatorics and applications, Vol. 1 (Kalamazoo, MI,
1988), Wiley-Intersci. Publ.}, pp.~407--418, Wiley, New York, 1991
(\faud; \gyarfas; \schelp)\mr93d:05085;\Zbl 840.05050.
 
\paper{91.22} On prime divisors of Mersenne numbers, {\it Acta
Arith.} {\bf 57} (1991) no.~3, 267--281 (\pkiss;
\pomer)\mr92d:11104;\Zbl 733.11003.
 
\paper{91.23} On some diophantine problems involving powers and
factorials, {\it J. Austral. Math. Soc. Ser. A} {\bf 51} (1991)
no.~1, 1--7 (\brindza)\mr92i:11036;\Zbl 746.11021.
 
\paper{91.24} On some of my favourite problems in graph theory and
block designs, Graphs, designs and combinatorial geometries
(Catania, 1989), {\it Matematiche (Catania)} {\bf 45} (1990)
no.~1, 61--73, 1991\mr93h:05052;\Zbl 737.05001.
 
\paper{91.25} On sums of a Sidon-sequence, {\it J. Number Theory}
{\bf 38} (1991) no.~2, 196--205 (\rfreud)\mr92g:11028;\Zbl
731.11008.
 
\paper{91.26} On the arithmetic means of Lagrange interpolation,
{\it Approximation theory (Kecskem\'et, 1990), Colloq. Math. Soc.
J\'anos Bolyai, 58}, pp.~263--274, North-Holland, Amsterdam, 1991
(\halasz)\mr94f:41003;\Zbl 767.41004.
 
\paper{91.27} On the expansion $1=\sum q^{-n_i}$, {\it Period. Math.
Hungar.} {\bf 23} (1991) no.~1, 27--30 (\ijoo)\mr92i:11030;\Zbl
747.11006.
 
\paper{91.28} On the uniqueness of the expansions $1=\sum q\sp
{-n\sb i}$, {\it Acta Math. Hungar.} {\bf 58} (1991) no.~3--4,
333--342 (\horvath; \ijoo)\mr93e:11012;\Zbl 747.11005.
 
\paper{91.29} Point distances determined by $n$ points in the
plane, {\it Geombinatorics} {\bf 1} (1991) no.~2, 3--4\cmp1 208 430.
 
\paper{91.30} Problems and results in combinatorial analysis and
combinatorial number theory, {\it Graph theory, combinatorics and
applications, Vol. 1 (Kalamazoo, MI, 1988), Wiley-Intersci. Publ.},
pp.~397--406, Wiley, New York, 1991\mr93g:05136;\Zbl 840.05094.
 
\paper{91.30a} Problems and results on polynomials and
interpolation, {\it Approximation theory (Kecskem\'et, 1990),
Colloq. Math. Soc. J\'anos Bolyai, 58}, pp.~253--261, North-Holland,
Amsterdam, 1991\mr94g:\-41002;\Zbl 768.41007.
 
\paper{91.31} Saturated $r$-uniform hypergraphs, {\it Discrete
Math.} {\bf 98} (1991) no.~2, 95--104 (\furedi;
\tuza)\mr92k:05095;\Zbl 766.05060.
 
\paper{91.32} Some extremal results in cochromatic and dichromatic
theory, {\it J. Graph Theory} {\bf 15} (1991) no.~6, 579--585
(\gimbel; \kratsch)\mr92i:05118;\Zbl 743.05047.
 
\paper{91.33} Some Ramsey-type theorems, {\it Discrete Math.} {\bf
87} (1991) no.~3, 261--269 (\galvin)\mr92b:05078;\Zbl 759.05095.
 
\paper{91.34} Sommes de sous-ensembles (Sums of subsets, in French,
English summary), {\it S\'em. Th\'eor. Nombres Bordeaux (2)} {\bf 3}
(1991) no.~1, 55--72 (\nico; \sark)\mr92k:11025;\Zbl 742.11008.
 
\paper{91.35} The dimension of random ordered sets, {\it Random
Structures Algorithms} {\bf 2} (1991) no.~3, 253--275 (\kierstead;
\trotter)\mr92g:06006;\Zbl 741.06001.
 
\paper{91.36} Three problems on the random walk in ${\bf Z}\sp d$,
{\it Studia Sci. Math. Hungar.} {\bf 26} (1991) no.~2--3, 309--320
(\revesz)\mr93k:60171;\Zbl 774.60036.
 
\paper{91.37} Vertex coverings by monochromatic cycles and trees,
{\it J. Combin. Theory Ser. B} {\bf 51} (1991) no.~1, 90--95
(\gyarfas; \pyber)\mr92g:05142;\Zbl 766.05062.

\year 1992
 
\paper{92.01} Appendix to {\it The probabilistic method\/} by Noga
Alon and Joel H. Spencer, {\it Wiley-Interscience Series in Discrete
Mathematics and Optimization}, John Wiley \& Sons, Inc., New York,
1992\mr93h:60002 (for entire book);\Zbl 767.05001 (for entire book).
 
\paper{92.02} Arithmetic progressions in subset sums, {\it Discrete
Math.} {\bf 102} (1992) no.~3, 249--264 (\sark)\mr93g:11015;\Zbl
758.11007.
 
\paper{92.03} Bounds for arrays of dots with distinct slopes on
lengths, {\it Combinatorica} {\bf 12} (1992) no.~1, 39--44 (\rlg;
\ruzsa; \htaylor)\mr93k:05182;\Zbl 774.05020.
 
\paper{92.04} Corrigendum: ``On the expansion $1=\sum q\sp {-n\sb
i}$'' [{\it Period. Math. Hungar.} {\bf 23} (1991) no.~1, 27--30],
{\it Period. Math. Hungar.} {\bf 25} (1992) no.~1, 113
(\ijoo)\mr93k:11017;\Zbl 761.11002.
 
\paper{92.05} Covering the cliques of a graph with vertices,
Topological, algebraical and combinatorial structures, Frol\'\i k's
memorial volume, {\it Discrete Math.} {\bf 108} (1992) no.~1--3,
279--289 (\gallai; \tuza)\mr93h:05124;\Zbl 766.05063.
 
\paper{92.06} Cycle-connected graphs, Topological, algebraical and
combinatorial structures, Frol\'\i k's memorial volume, {\it
Discrete Math.} {\bf 108} (1992) no.~1--3, 261--278 (\rduke;
\rodl)\mr94a:05106;\Zbl 776.05057.
 
\paper{92.07} Diameters of point sets, {\it Geombinatorics} {\bf 1}
(1992) no.~4, 4\cmp1 208 439;\Zbl 850.52004.
 
\paper{92.08} Distances determined by points in the plane, {\it
Geombinatorics} {\bf 2} (1992) no.~1, 7\cmp1 208 444;\Zbl
850.52006.
 
\paper{92.09} Distances determined by points in the plane, II.,
{\it Geombinatorics} {\bf 2} (1992) no.~2, 24\cmp1 208 447;\Zbl
850.52007.
 
\paper{92.10} Distributed loop network with minimum transmission
delay, {\it Theoret. Comput. Sci.} {\bf 100} (1992) no.~1, 223--241
(\dfhsu)\mr93d:68006;\Zbl 780.68005.
 
\paper{92.11} Diverse homogeneous sets, {\it J. Combin Theory Ser.
A} {\bf 59} (1992) no.~2, 312--317 (\blass;
\ataylor)\mr92j:05178;\Zbl 757.05010.
 
\paper{92.12} Extremal problems involving vertices and edges on odd
cycles, Special volume to mark the centennial of Julius Petersen's
``Die Theorie der regul\"aren Graphs'', Part II, {\it Discrete
Math.} {\bf 101} (1992) no.~1--3, 23--31 (\faud;
\rous)\mr93g:05074;\Zbl 767.05056.
 
\paper{92.13} How many edges should be deleted to make a
triangle-free graph bipartite?, {\it Sets, graphs and numbers
(Budapest, 1991), Colloq. Math. Soc. J\'anos Bolyai, 60},
pp.~239--263, North-Holland, Amsterdam, 1992 (\gyori;
\simon)\mr94b:05104;\Zbl 785.05052.
 
\paper{92.14} In memory of Tibor Gallai, {\it Combinatorica} {\bf 12}
(1992) no.~4, 373--374\mr93m:01054b;\Zbl 760.01009.
 
\paper{92.15} Obituary of my friend and coauthor Tibor Gallai, {\it
Geombinatorics} {\bf 2} (1992) no.~1, 5--6 [corrections: {\bf 2}
(1992) no.~2, 37]\cmp1 208 443;\Zbl 842.01021 [corrections\Zbl
842.01022].
 
\paper{92.16} On a problem of Tam\'as Varga, {\it Bull. Soc. Math.
France} {\bf 120} (1992) no.~4, 507--521 (\mjoo;
\ijoo)\mr93m:11076;\Zbl 787.11002.
 
\paper{92.17} On prime-additive numbers, {\it Studia Sci. Math.
Hungar.} {\bf 27} (1992) no.~1--2, 207--212
(\hegyvari)\mr94a:11156;\Zbl 791.11053 and 688.10043.
 
\paper{92.18} On some of my favourite problems in various branches
of combinatorics, {\it Fourth Czechoslovakian Symposium on
Combinatorics, Graphs and Complexity (Prachatice, 1990), Ann.
Discrete Math., 51}, pp.~69--79, North-Holland, Amsterdam,
1992\mr93k:05001;\Zbl 760.05025.
 
\paper{92.19} On some unsolved problems in elementary geometry (in
Hungarian), {\it Mat. Lapok (N.S.)} {\bf 2} (1992) no.~2,
1--10\mr95b:52029.
 
\paper{92.20} On the minimum size of graphs with a given bandwidth,
{\it Bull. Inst. Combin. Appl.} {\bf 6} (1992), 22--32 (\alavi;
\jqliu; \mccanna)\mr93g:05071;\Zbl 829.05055.
 
\paper{92.21} On the number of expansions $1=\sum q\sp {-n\sb i}$,
{\it Ann. Univ. Sci. Budapest E\"otv\"os Sect. Math.} {\bf 35}
(1992), 129--132 (\ijoo)\mr94a:11012;\Zbl 805.11011.
 
\paper{92.22} On the number of pairs of partitions of $n$ without
common subsums, {\it Colloq. Math.} {\bf 63} (1992) no.~1, 61--83
(\nico; \sark)\mr93c:11087;\Zbl 799.11044.
 
\paper{92.23} On totally supercompact graphs, Combinatorial
mathematics and applications (Calcutta, 1988), {\it Sankhy\=a Ser.
A} {\bf 54} (1992), Special Issue, 155--167 (\simon; \sos;
\sbrao)\mr94g:05071;\Zbl 882.05077.
 
\paper{92.24} Size Ramsey functions, {\it Sets, graphs and numbers
(Budapest, 1991), Colloq. Math. Soc. J\'anos Bol\-yai, 60},
pp.~219--238, North-Holland, Amsterdam, 1992
(\faud)\mr94e:05185;\Zbl 794.05084.
 
\paper{92.25} Small transversals in uniform hypergraphs, Siberian
Advances in Mathematics, {\it Siberian Adv. Math.} {\bf 2} (1992)
no.~1, 82--88 (\flaass; \kosto; \tuza)\mr93b:05076;\Zbl 848.05049.
 
\paper{92.26} Subgraphs of large minimal degree, {\it Random graphs,
Vol.~2 (Pozna\'n, 1989), Wiley-Intersci Publ.}, pp.~59--66, Wiley,
New York, 1992 (\luczak; \spenc)\mr94b:05169;\Zbl 817.05056.
 
\paper{92.27} The distribution of quotients of small and large
additive functions, II., {\it Proceedings of the Amalfi Conference
on Analytic Number Theory (Maiori, 1989)}, pp.~83--93, Univ.
Salerno, Salerno, 1992 (\ivic)\mr94i:11074;\Zbl 791.11051.
 
\paper{92.28} Tournaments that share several common moments with
their complements, {\it Bull. Inst. Combin. Appl.} {\bf 4} (1992),
65--89 (\hchen; \schwenk)\mr92j:05086;\Zbl 829.05033.



\year 1993
 
\paper{93.01} Asymptotic bounds for irredundant Ramsey numbers, {\it
Quaestiones Math.} {\bf 16} (1993) no.~3, 319--331
(\hattingh)\mr94j:05086;\Zbl 794.05086.
 
\paper{93.02} Clique coverings of the edges of a random graph, {\it
Combinatorica} {\bf 13} (1993) no.~1, 1--5 (\boll; \spenc;
\dbwest)\mr94g:05076;\Zbl 782.05072.
 
\paper{93.03} Clique partitions of chordal graphs, {\it Combin.
Probab. Comput.} {\bf 2} (1993) no.~4, 409--415 [reprinted in {\it
Combinatorics, geometry and probability---A tribute to
Paul Erd\H os}, papers from the conference  (Cambridge, 1993) in
honor of Erd\H os's 80th birthday, B.~Bollob\'as and A.~Thomason,
ets., pp.~291--297, Cambridge Univ. Press, Cambridge, 1997]
(\ordman; \zalc)\mr95g:05080;\Zbl 793.05081, 876.05051.
 
\paper{93.04} Errata: ``Distances determined by points in the
plane, II.'' [{\it Geombinatorics} {\bf 2} (1992) no.~2, 24], {\it
Geombinatorics} {\bf 2} (1993) no.~3, 65\cmp1 208 453.
 
\paper{93.05} Estimates of the least prime factor of a binomial
coefficient, {\it Math. Comp.} {\bf 61} (1993) no.~203, 215--224
(\lacamp; \selfr)\mr93k:11013;\Zbl 781.11008.
 
\paper{93.06} Extremal problems for the Bondy-Chv\'atal closure
of a graph, {\it Graphs, matrices and designs, Lecture Notes in Pure
and Appl. Math., 139}, pp.~73--83, Dekker, New York, 1993 (\lhclark;
\entringer; \hcsun; \szekely)\mr94a:05105;\Zbl 797.05056.
 
\paper{93.07} Forcing two sums simultaneously, {\it A tribute to
Emil Grosswald: number theory and related analysis, Contemp. Math.,
143}, pp.~321--328, Amer. Math. Soc., Providence, RI, 1993 (\newman;
\knapp)\mr94d:41021;\Zbl 808.41006.
 
\paper{93.08} Monochromatic infinite paths, {\it Discrete Math.}
{\bf 113} (1993) no.~1--3, 59--70 (\galvin)\mr94c:\-05045;\Zbl
787.05071.
 
\paper{93.09} Nearly equal distances in the plane, {\it Combinat.
Probab. Comput} {\bf 2} (1993) no.~4, 401--408 [reprinted in {\it
Combinatorics, geometry and probability---A tribute to
Paul Erd\H os}, papers from the conference (Cambridge, 1993) in
honor of Erd\H os's 80th birthday, B.~Bollob\'as and A.~Thomason,
ets., pp.~283--290, Cambridge Univ. Press, Cambridge, 1997] (\makai;
\pach)\mr95i:52018;\Zbl 798.52017, 889.52017.

\paper{93.09a}  N\'eh\'any kedvenc probl\'em\'am [Some of my
favorite problems], {\it Polygon} {\bf 3} (1993) no.~2,
65--67.
 
\paper{93.10} On elements of sumsets with many prime factors, {\it
J. Number Theory} {\bf 44} (1993) no.~1, 93--104 (\pomer; \sark;
\stewart)\mr94b:11011;\Zbl 780.11040.
 
\paper{93.11} On graphical partitions, {\it Combinatorica} {\bf 13}
(1993) no.~1, 57--63 (\richmond)\mr94g:11088;\Zbl 790.05008.
 
\paper{93.12} On sets of coprime integers in intervals, {\it
Hardy-Ramanujan J.} {\bf 16} (1993), 1--20 (\sark)\mr94e:11102;\Zbl
776.11011.
 
\paper{93.13} On the number of expansions $1=\sum q\sp {-n\sb i}$,
II., {\it Ann. Univ. Sci. Budapest. E\"otv\"os Sect. Math.} {\bf 36}
(1993), 229--233 (\ijoo)\mr95c:11012;\Zbl 805.11012.
 
\paper{93.14} Ordinal partition behavior of finite powers of
cardinals, {\it Finite and infinite combinatorics in sets and logic
(Banff, AB, 1991), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci.,
411}, pp.~97--115, Kluwer Acad. Publ., Dordrecht, 1993 (\hajnal;
\larson)\mr95b:03051;\Zbl 780.00039 (for entire conference
proceedings).
 
\paper{93.15} Rainbow subgraphs in edge-colorings of complete graphs,
{\it Quo vadis graph theory?, Ann. Discrete Math., 55}, pp.~81--88,
North-Holland, Amsterdam, 1993 (\tuza)\mr94b:05078;\Zbl 791.05037.
 
\paper{93.16} Ramsey problems in additive number theory, {\it Acta
Arith.} {\bf 64} (1993) no.~4, 341--355 (\boll;
\gpjin)\mr94g:11009;\Zbl 789.11007.
 
\paper{93.17} Ramsey problems involving degrees in edge-colored
complete graphs of vertices belonging to mono\-chromatic subgraphs,
{\it European J. Combin.} {\bf 14} (1993) no.~3, 183--189 (\gchen;
\rous; \schelp)\mr94a:05148;\Zbl 785.05067.
 
\paper{93.18} Ramsey size linear graphs, {\it Combin. Probab.
Comput.} {\bf 2} (1993) no.~4, 389--399 (\faud; \rous;
\schelp)\mr95c:05087;\Zbl 794.05085 [reprinted in {\it
Combinatorics, geometry and probability---A tribute to
Paul Erd\H os}, papers from the conference (Cambridge, 1993) in
honor of Erd\H os's 80th birthday, B.~Bollob\'as and A.~Thomason,
ets., pp.~241--251, Cambridge Univ. Press, Cambridge, 1997]\cmp 1
476 448;\Zbl 876.05071].
 
\paper{93.18a} Repeating distances between points in the plane,
{\it Geombinatorics} {\bf 2} (1993) no.~2, 57 (\pach);\Zbl
850.52009.
 
\paper{93.19} Some of my favorite solved and unsolved problems in
graph theory, {\it Quaestiones Math.} {\bf 16} (1993) no.~3,
333--350\mr94i:05045;\Zbl 794.05054.
 
\paper{93.20} Some of my favourite problems in various branches of
combinatorics, Combinatorics 92 (Catania, 1992), {\it Matematiche
(Catania)} {\bf 47} (1992) no.~2, 231--240, 1993\mr95c:05042;\Zbl
797.05001.
 
\paper{93.21} Some of my forgotten problems in number theory, {\it
Hardy-Ramanujan J.} {\bf 15} (1992), 34--50, 1993\mr94b:11001;\Zbl
779.11001.
 
\paper{93.22} Some problems and results in cochromatic theory, {\it
Quo vadis graph theory?, Ann. Discrete Math., 55}, pp.~261--264,
North-Holland, Amsterdam, 1993 (\gimbel)\mr94d:05054;\Zbl 791.05038.
 
\paper{93.23} Some solved and unsolved problems in combinatorial
number theory, II., {\it Colloq. Math.} {\bf 65} (1993) no.~2,
201--211 (\sark)\mr94j:11012;\Zbl 909.11010.
 
\paper{93.24} The grid revisited, Graph theory and combinatorics
(Marseille-Luminy, 1990), {\it Discrete Math.} {\bf 111} (1993)
no.~1--3, 189--196 (\furedi; \pach; \ruzsa)\mr94g:52022;\Zbl
794.52004.
 
\paper{93.25} The size Ramsey number of a complete bipartite graph,
{\it Discrete Math.} {\bf 113} (1993) no.~1--3, 259--262
(\rous)\mr93k:05117;\Zbl 778.05059.
 
\paper{93.26} The smallest order of a graph with domination number
equal to two and with every vertex contained in a $K_n$, {\it Ars
Combin.} {\bf 35} (1993) A, 217--223 (\henning;
\swart)\mr94m:05100;\Zbl 840.05035.
 
\paper{93.27} Triangles in convex polygons, {\it Geombinatorics}
{\bf 2} (1993) no.~4, 72--74 (\soifer)\cmp1 214 695;\Zbl 844.52002.
 
\paper{93.28} Tur\'an-Ramsey theorems and simple asymptotically
extremal structures, {\it Combinatorica} {\bf 13} (1993) no.~1,
31--56 (\hajnal; \simon; \sos; \szem)\mr94d:05088;\Zbl 774.05050.
 
\paper{93.29} Upper bound of $\sum 1/(a\sb i\log a\sb i)$ for
primitive sequences, {\it Proc. Amer. Math. Soc.} {\bf 117} (1993)
no.~4, 891--895 (\zhang)\mr93e:11018;\Zbl 776.11013.
 
\paper{93.30} Upper bound of $\sum 1/(a\sb i\log a\sb i)$ for
quasi-primitive sequences, {\it Comput. Math. Appl.} {\bf 26} (1993)
no.~3, 1--5 (\zhang)\mr94f:11013;\Zbl 781.11011.

\year 1994

\paper{94.00a}\newc A few problems, {\it Graph Theory Notes of New
York} (The New York Academy of Sciences) {\bf XXVII} (1994),
7--8.

\paper{94.01} A local density condition for triangles, Graph theory
and applications (Hakone, 1990), {\it Discrete Math.} {\bf 127}
(1994) no.~1--3, 153--161 (\faud; \rous; \schelp)\mr95b:05109;\Zbl
796.05050.
 
\paper{94.02} A postscript on distances in convex $n$-gons, {\it
Discrete Comput. Geom.} {\bf 11} (1994) no.~1, 111--117
(\fishburn)\mr94j:52035;\Zbl 815.52006.
 
\paper{94.03} Changes of leadership in a random graph process,
Proceedings of the Fifth International Seminar on Random Graphs and
Probabilistic Methods in Combinatorics and Computer Science
(Pozna\'n, 1991), {\it Random Structures Algorithms} {\bf 5} (1994)
no.~1, 243--252 (\luczak)\mr95c:05110;\Zbl 792.60009.
 
\paper{94.04} Clique partitions of split graphs, {\it
Combinatorics, graph theory, algorithms and applications (Beijing,
1993)}, pp.~21--30, World Sci. Publishing, River Edge, NJ, 1994
(\gchen; \ordman)\mr96a:05114.
 
\paper{94.05} Crossing families, {\it Combinatorica} {\bf 14}
(1994) no.~2, 127--134 [also appeared in {\it Proceedings
of the Seventh Annual Symposium on Computational Geometry, June
10--12, 1991, North Conway, NH\/}, ACM Press, 1991, 351--356] 
(\aronov; \goddard; \kleit; \klugerman; \pach;
\schulman)\mr95e:52025;\Zbl 804.52010.
 
\paper{94.06} Distinct distances between points in the plane, {\it
Geombinatorics} {\bf 3} (1994) no.~4, 115--116\cmp1 268 719;\Zbl
850.52010.
 
\paper{94.06a} Equidistant points in the plane,
{\it Geombinatorics} {\bf 4} (1994) no.~2, 48;\Zbl 843.52012.
 
\paper{94.06a} Errata: ``Sets of points in the plane with few
isosceles triangles'' [{\it Geombinatorics} {\bf 4} (1994) no.~1,
10], {\it Geombinatorics} {\bf 4} (1994) no.~2, 57.
 
\paper{94.07} Extremal problems and generalized degrees, Graph
theory and applications (Hakone, 1990), {\it Discrete Math.} {\bf
127} (1994) no.~1--3, 139--152 (\faud; \rous)\mr95d:05069;\Zbl
796.05049.
 
\paper{94.08} Independent transversals in sparse partite
hypergraphs, {\it Combin. Probab. Comput.} {\bf 3} (1994) no.~3,
293--296 (\gyarfas; \luczak)\mr96b:05125;\Zbl 811.05068.
 
\paper{94.09} Local and global average degree in graphs and
multigraphs, {\it J. Graph Theory} {\bf18} (1994) no.~7, 647--661
(\bertram; \horak;
\siran; \tuza)\mr96a:05139;\Zbl 812.05032.
 
\paper{94.10} On additive properties of general sequences, Trends in
discrete mathematics, {\it Discrete Math.} {\bf 136} (1994)
no.~1--3, 75--99 (\sark; \sos)\mr96d:11014;\Zbl 818.11009.
 
\paper{94.11} On an interpolation theoretical extremal problem,
{\it Studia Sci. Math. Hungar.} {\bf 29} (1994) no.~1--2, 55--60
(\szab; \varma;
\verte)\mr95f:41002;\Zbl 817.41006.
 
\paper{94.12} On isolated, respectively consecutive large values of
arithmetic functions, {\it Acta Arith.} {\bf 66} (1994) no.~3,
269--295 (\sark)\mr95c:11111;\Zbl 802.11035.
 
\paper{94.13} On maximal triangle-free graphs, {\it J. Graph Theory}
{\bf 18} (1994) no.~6, 585--594 (\holzman)\mr95g:05057;\Zbl
807.05040.
 
\paper{94.14} On partitions of lines and space, {\it Fund. Math.}
{\bf 145} (1994) no.~2, 101--119 (\jackson;
\mauldin)\mr95k:04003;\Zbl 809.04004.
 
\paper{94.15} On prime factors of subset sums, {\it J. London Math.
Soc. (2)} {\bf 49} (1994) no.~2, 209--218 (\sark;
\stewart)\mr95d:11128;\Zbl 841.11048.
 
\paper{94.16} On sum sets of Sidon sets, I., {\it J. Number Theory}
{\bf 47} (1994) no.~3, 329--347 (\sark; \sos)\mr95e:11030;\Zbl
811.11014.
 
\paper{94.17} On the densities of sets of multiples, {\it J. Reine
Angew. Math.} {\bf 454} (1994), 119--141 (\rrhall;
\tenen)\mr95k:11115;\Zbl 814.11043.
 
\paper{94.18} On the number of $q$-expansions, {\it Ann. Univ. Sci.
Budapest. E\"otv\"os Sect. Math.} {\bf 37} (1994), 109--118 (\ijoo;
\komornik)\mr96d:11011;\Zbl 824.11005.
 
\paper{94.19} Problems and results in discrete mathematics, Trends
in discrete mathematics, {\it Discrete Math.} {\bf 136} (1994)
no.~1--3, 53--73\mr96a:52025;\Zbl 818.52014.
 
\paper{94.20} Problems and results on set systems and hypergraphs,
{\it Extremal problems for finite sets (Visegr\'ad, 1991), Bolyai
Soc. Math. Stud., 3}, pp.~217--227, J\'anos Bolyai Math. Soc.,
Budapest, 1994\mr95k:05131;\Zbl 820.05057.
 
\paper{94.06a} Sets of points in the plane with few isosceles
triangles, {\it Geombinatorics} {\bf 4} (1994) no.~1, 10;\Zbl
850.52011.
 
\paper{94.20a} Similar configurations and pseudo grids,
{\it Intuitive geometry (Szeged, 1991), Colloq. Math. Soc. J\'anos
Bolyai, 63}, pp.~85--104, North-Holland, Amsterdam-New York,
1994 (\elekes)\mr97b:52020;\Zbl 822.52004.
 
\paper{94.21} Some problems in number theory, combinatorics and
combinatorial geometry, {\it Math. Pannon.} {\bf 5} (1994)
no.~2, 261--269\mr95j:11018;\Zbl 815.11002.
 
\paper{94.22} Tur\'an-Ramsey theorems and $K_p$-independence
numbers, {\it Combin. Probab. Comput.} {\bf 3} (1994) no.~3,
297--325, [reprinted in {\it Combinatorics, geometry and
probability---A tribute to Paul Erd\H os}, papers from the
conference (Cambridge, 1993) in honor of Erd\H os's 80th birthday,
B.~Bollob\'as and A.~Thomason, ets., pp.~253--281, Cambridge Univ.
Press, Cambridge, 1997] (\hajnal; \simon; \sos;
\szem)\mr96b:05078;\Zbl 812.05031, 876.05050.



\year 1995

\paper{95.01} A problem in covering progressions, {\it Studia Sci.
Math. Hungar.} {\bf 30} (1995) no.~1--2, 149--154
(\spenc)\mr96f:11018;\Zbl 862.11007.
 
\paper{95.02} Coverings of $r$-graphs by complete $r$-partite
subgraphs, Proceedings of the Sixth International Seminar on Random
Graphs and Probabilistic Methods in Combinatorics and Computer
Science, ``Random Graphs '93'' (Pozna\'n, 1993), {\it Random
Structures Algorithms} {\bf 6} (1995) no.~2--3, 319--322
(\rodl)\mr96i:05129;\Zbl 818.05037.
 
\paper{95.04} Degree sequence and independence in $K_4$-free
graphs, {\it Discrete Math.} {\bf 141} (1995) no.~1--3, 285--290
(\faud; \reid; \schelp; \staton)\mr96b:05079;\Zbl 833.05074.
 
\paper{95.05} Discrepancy of trees, {\it Studia Sci. Math. Hungar.}
{\bf 30} (1995) no.~1--2, 47--57 (\furedi; \loebl;
\sos)\mr96e:05113;\Zbl 849.05021.
 
\paper{95.06} Equal distance sums in the plane, {\it Normat} {\bf
43} (1995) no.~4, 150--161 (\beck; \bejlegaard;
\fishburn)\mr96m:52024;\Zbl 853.52017.
 
\paper{95.07} Extremal graphs for intersecting triangles, {\it J.
Combin. Theory Ser. B} {\bf 64} (1995) no.~1, 89--100 (\furedi;
\gould; \gunder)\mr96e:05080;\Zbl 822.05036.
 
\paper{95.08} Extremal problems in combinatorial geometry, {\it
Handbook of Combinatorics, Vol. 1, 2}, pp.~809--874, Elsevier,
Amsterdam, 1995 (\purdy)\mr96m:52025;\Zbl 852.52009.
 
\paper{95.09} Independence of solution sets and minimal asymptotic
bases, {\it Acta Arith.} {\bf 69} (1995) no.~3, 243--258
(\nath; \tetal)\mr96e:11014;\Zbl 828.\-11006.
 
\paper{95.10} Intervertex distances in convex polygons, ARIDAM VI
and VII (New Brunswick, NJ, 1991/1992), {\it Discrete Appl. Math.}
{\bf 60} (1995) no.~1--3, 149--158 (\fishburn)\mr96f:52025;\Zbl
831.52009.
 
\paper{95.11} Monochromatic and zero-sum sets of nondecreasing
diameter, {\it Discrete Math.} {\bf 137} (1995) no.~1--3, 19--34
(\bial; \lefmann)\mr96e:05172;\Zbl 822.05046.
 
\paper{95.12} Multiplicities of interpoint distances in finite
planar sets, ARIDAM VI and VII (New Brunswick, NJ, 1991/1992), {\it
Discrete Appl. Math.} {\bf 60} (1995) no.~1--3, 141--147
(\fishburn)\mr96f:52024;\Zbl 831.52008.
 
\paper{95.13} On practical partitions, {\it Collect. Math.} {\bf
46} (1995) no.~1--2, 57--76 (\nico)\mr97b:11122;\Zbl 842.11035.
 
\paper{95.14} On product representations of powers, I., {\it
European J. Combin.} {\bf 16} (1995) no.~6, 567--588 (\sark;
\sos)\mr97a:11145;\Zbl 840.11010.

\paper{95.14a}\newa On some problems in combinatorial set theory,
Duro Kurepa memorial volume, {\it Publ. Inst. Math. (Beograd)
(N.S.)} {\bf 57(71)} (1995), 61--65\mr 97g:04001;\Zbl 862.04003.
 
\paper{95.15} On sum sets of Sidon sets, II., {\it Israel J. Math.}
{\bf 90} (1995) no.~1--3, 221--233 (\sark; \sos)\mr96f:11034;\Zbl
841.11006.
 
\paper{95.16} On the book size of graphs with large minimum degree,
{\it Studia Sci. Math. Hungar.} {\bf 30} (1995) no.~1--2, 25--46
(\faud; \gyori)\mr96f:05135;\Zbl 849.05038.
 
\paper{95.17} On the integral of the Lebesgue function of
interpolation, II., {\it Acta Math. Hungar.} {\bf 68} (1995)
no.~1--2, 1--6 (\szab; \verte)\mr96b:41003;\Zbl 842.41003.
 
\paper{95.18} On the 120th anniversary of the birth of Schur, {\it
Geombinatorics} {\bf 5} (1995) no.~1, 4--5\cmp1 337 152;\Zbl
842.01028.
 
\paper{95.19} On the size of a random maximal graph, Proceedings of
the Sixth International Seminar on Random Graphs and Probabilistic
Methods in Combinatorics and Computer Science, ``Random Graphs '93''
(Pozna\'n, 1993), {\it Random Structures Algorithms} {\bf 6} (1995)
no.~2--3, 309--318 (\suen; \winkler)\mr96h:05176;\Zbl 820.05054.
 
\paper{95.20} Some of my favourite problems in number theory,
combinatorics, and geometry, Combinatorics Week (Portuguese) (S\~ao
Paulo, 1994), {\it Resenhas} {\bf 2} (1995) no.~2,
165--186\mr 97e:11003;\Zbl 871.11002.

\paper{95.20a}\newa Some of my recent problems in combinatorial
number theory, geometry and combinatorics, {\it Graph theory,
combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992),
Wiley-Intersci. Publ.}, pp.~335--349, Wiley, New York,
1995\mr 97k:52019;\Zbl 849.11024.
 
\paper{95.21} Some old and new problems in approximation theory:
research problems 95-1, {\it Constr. Approx.} {\bf 11} (1995) no.~3,
419--421\cmp1 350 678.

\paper{95.21a}\newa Some problems in number theory, {\it Octogon
Math. Mag.} {\bf 3} (1995) no.~2, 3--5\mr96j:11001;\Zbl 913.11001.
 
\paper{95.22} Squares in a square, {\it Geombinatorics} {\bf 4}
(1995) no.~4, 110--114 (\soifer)\cmp1 330 337;\Zbl 850.52013.

\paper{95.22a}\newa Strictly ascending pairs and waves, {\it Graph
theory, combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI,
1992), Wiley-Intersci. Publ.}, pp.~83--95, Wiley, New York, 1995
(\boll; \gpjin)\mr 97i:11017;\Zbl 844.05012.
 
\paper{95.23} Sur le graphe divisoriel (The divisor graph, in
French), {\it Acta Arith.} {\bf 73} (1995) no.~2, 189--198
(\saias)\mr97b:11118;\Zbl 847.11048.

\paper{95.23a}\newa The $k$-spectrum of a graph, {\it Graph theory,
combinatorics, and algorithms, Vol. 1, 2 (Kalamazoo, MI, 1992),
Wiley-Intersci. Publ.}, pp.~377--389, Wiley, New York, 1995 (\sos;
\faud)\mr 97d:05266;\Zbl 843.05056.

\paper{95.23b}\newb The Smarandache function, inter alia (letter to
the editor), {\it Mathematical Spectrum (Sheffield University)}
{\bf 27} (1994/95) no.~2, 43--44.
 
\paper{95.24} Two combinatorial problems in the plane, {\it Discrete
Comput. Geom.} {\bf 13} (1995) no.~3--4, 441--443
(\purdy)\mr96a:52026;\Zbl 826.52009.
 
\paper{95.25} Vertex covering with monochromatic paths, Festschrift
for Hans Vogler on the occasion of his 60th birthday, {\it Math.
Pannon.} {\bf 6} (1995) no.~1, 7--10 (\gyarfas)\mr96c:05127;\Zbl
828.05040.

\paper{95.25a}\newa Vertex coverings of the edge set in a connected
graph, {\it Graph theory, combinatorics, and algorithms, Vol. 1, 2
(Kalamazoo, MI, 1992), Wiley-Intersci. Publ.}, pp.~1179--1187,
Wiley, New York, 1995 (\tuza)\mr 97d:05221;\Zbl 842.05046.

 
\year 1996

\paper{96.01}\newa A note on triangle-free graphs, {\it Random
discrete structures (Minneapolis, MN, 1993), IMA Vol.
Math. Appl., 76}, pp.~117--119, Springer, New York, 1996 (\janson;
\luczak; \spenc)\mr97b:05139;\Zbl 842.05080.

\paper{96.02}\newa A remark on Pisier type theorems, Festschrift
for C. St.~J. A. Nash-Williams, {\it Congr. Numer.} {\bf 113}
(1996), 101--109 (\nese; \rodl)\mr 97k:05147;\Zbl 974.05059.

\paper{96.03}\newa  Complete sequences of sets of integer powers,
{\it Acta Arith.} {\bf 77} (1996) no.~2, 133--138 (\burr; \rlg;
\winnie)\mr 97e:11035;\Zbl 863.11014.

\paper{96.04}\newa Convex nonagons with five intervertex distances,
{\it Geom. Dedicata} {\bf 60} (1996) no.~3, 317--332
(\fishburn)\mr 97e:52026;\Zbl 849.52014.

\paper{96.05}\newa Covering and independence in triangle
structures, Selected papers in honour of Paul Erd\H os on the
occasion of his 80th birthday (Keszthely, 1993), {\it Discrete
Math.} {\bf 150} (1996) no.~1--3, 89--101 (\gallai; \tuza)\mr
97d:05222;\Zbl 857.05077.
 
\paper{96.06} $d$-complete sequences of integers, {\it Math. Comp.}
{\bf 65} (1996) no.~214, 837--840 (\lewin)\mr96g:11008;\Zbl
866.11017.

\paper{96.07}\newa  Distances between points in the plane, {\it
Geombinatorics} {\bf 5} (1996) no.~4, 129--131\mr96m:52026;\Zbl
850.52015.

\paper{96.07a}\newb Graphs having no short even cycles, Proceedings
of the Twenty-seventh Southeastern International Conference on
Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 1996),
{\it Congr. Numer.} {\bf 121} (1996), 243--253 (\debose;
\hobbs)\mr 97h:05097;\Zbl 896.05037.

\paper{96.08}\newa Graphs in which each $C_4$ spans $K_4$, {\it
Discrete Math.} {\bf 154} (1996) no.~1--3, 263--268 (\gyarfas;
\luczak)\mr97a:05121;\Zbl 854.05061.

\paper{96.09}\newa Hypercube subgraphs with minimal detours, {\it J.
Graph Theory} {\bf 23} (1996) no.~2, 119--128 (\hamburg; \pippert;
\weakley)\mr 98g:05052;\Zbl 857.05027.

\paper{96.10}\newa Large subgraphs of minimal density or degree,
{\it J. Combin. Math. Combin. Comput.} {\bf 22} (1996), 87--96
(\faud; \jagota; \luczak)\mr 97f:05093;\Zbl 865.05052.

\paper{96.11}\newa Maximum planar sets that determine $k$
distances, {\it Discrete Math.} {\bf 160} (1996) no. 1--3, 115--125
(\fishburn)\mr 97m:05016;\Zbl 868.52007.
 
\paper{96.12} On a class of aperiodic sum-free sets, {\it Math.
Proc. Cambridge Philos. Soc.} {\bf 120} (1996) no.~1, 1--5
(\calkin)\mr97b:11030;\Zbl 866.11019.

\paper{96.13}\newa On $k$-saturated graphs with restrictions on the
degrees, {\it J. Graph Theory} {\bf 23} (1996) no.~1, 1--20 (\alon;
\holzman; \krivel)\mr 97e:05104;\Zbl 857.05051.

\paper{96.13a}\newb On Pisot numbers, {\it Ann. Univ. Sci.
Budapest. E\"otv\"os Sect. Math.} {\bf 39} (1996), 95--99 (\ijoo;
\schnitz)\mr 98d:11127;\Zbl 880.11067.

\paper{96.14}\newa On some of my favourite theorems, {\it
Combinatorics, Paul Erd\H os is eighty, Vol.~2 (Keszthely, 1993),
Bolyai Soc. Math. Stud., 2}, pp.~97--132, J\'anos Bolyai Math.
Soc., Budapest, 1996\mr 97g:00002;\Zbl 853.11001.

\paper{96.15}\newa On the number of divisors of $n!$, {\it Analytic
number theory, Vol.~1 (Allerton Park, IL, 1995), Progr. Math.,
138}, pp.~337--355, Birkh\"auser Boston, Boston, MA, 1996 (\sid;
\ivic; \pomer)\mr 97d:11142;\Zbl 858.11051.

\paper{96.16}\newa On the size of products of distances from
prescribed points, {\it Math. Proc. Cambridge Philos. Soc.} {\bf
120} (1996) no.~3, 403--409 (\totik)\mr 98c:52021;\Zbl 865.41008.

\paper{96.17}\newa  On the sum of the reciprocals of the differences
between consecutive primes, {\it Number theory (New York,
1991--1995)}, pp.~97--101, Springer, New York, 1996 (\nath)\mr
97h:11094;\Zbl 863.11058.
 
\paper{96.18} Proof of a conjecture of Bollob\'as on nested cycles,
{\it J. Combin. Theory Ser. B} {\bf 66} (1996) no.~1, 38--43
(\gchen; \staton)\mr97b:05083;\Zbl 835.05036.

\paper{96.19}\newa Ramsey-remainder, {\it European J. Combin.} {\bf
17} (1996) no.~6, 519--532 (\tuza; \valtr)\mr 98d:05146;\Zbl
858.05073.

\paper{96.20}\newa  Sets of prime numbers satisfying a
divisibility condition, {\it J. Number Theory} {\bf 61} (1996)
no.~1, 39--43 (\abevans)\mr 97g:11019;\Zbl 869.11001.

\paper{96.21}\newa Sets versus divisors, {\it Combinatorics,
Paul Erd\H os is eighty, Vol.~2 (Keszthely, 1993), Bolyai
Soc. Math. Stud., 2}, pp.~193--212, J\'anos Bolyai Math. Soc.,
Budapest, 1996 (\schonheim)\mr 97j:05056;\Zbl 845.05096.

\paper{96.22}\newa Sizes of graphs with induced subgraphs of large
maximum degree, {\it Discrete Math.} {\bf 158} (1996) no. 1--3,
283--286 (\reid; \schelp; \staton)\mr 97d:05162;\Zbl 858.05057.

\paper{96.23}\newa Some of my favourite problems on cycles
and colourings, Cycles and colourings '94 (Star\'a Lesn\'a,
1994), {\it Tatra Mt. Math. Publ.} {\bf 9} (1996), 7--9\mr
97f:05094;\Zbl 846.05025.

\paper{96.24}\newa Some problems I presented or planned to present
in my short talk, {\it Analytic number theory, Vol.~1 (Allerton
Park, IL, 1995), Progr. Math., 138}, pp.~333--335, Birkh\"auser
Boston, Boston, MA, 1996\mr 97m:11011;\Zbl 871.11003.
 
\paper{96.25} Sure monochromatic subset sums, {\it Acta Arith.} {\bf
74} (1996) no.~3, 269--272 (\alon)\mr97a:11034;\Zbl 838.11018.

\paper{96.26}\newb Two theorems of Arkin-Arney-Erdos, Proceedings of
the Twenty-seventh Southeastern International Conference on
Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 1996),
{\it Congr. Numer.} {\bf 119} (1996), 151--159 (\arkin;
\arney)\cmp  1 431 944;\Zbl 902.11003.

\year 1997

\paper{97.01}\newb A class of edge critical $4$-chromatic graphs,
{\it Graphs Combin.} {\bf 13} (1997) no.~2, 139--146 (\gchen;
\gyarfas; \schelp)\mr 98c:05057;\Zbl 881.05044.

\paper{97.02}\newc A variant of the classical Ramsey problem,
{\it Combinatorica} {\bf 17} (1997) no. 4, 459--467 (\gyarfas)\mr
99h:05090;\Zbl 910.05034.

\paper{97.03}  Are there many distances that occur few times?,
{\it Geombinatorics} {\bf 6} (1997) no.~3, 77--78
(\pach)\mr97m:52036;\Zbl 874.52010.

\paper{97.04}\newb Covering a graph by complete bipartite
graphs, {\it Discrete Math.} {\bf 170} (1997) no.~1--3, 249--251
(\pyber)\mr 97m:05199;\Zbl 876.05080.

\paper{97.05}\newb Dense difference sets and their
combinatorial structure, {\it The mathematics of Paul Erd\H os,
Vol. I, Algorithms Combin., 13}, pp.~165--175, Springer, Berlin,
1997 (\bergel; \hindman; \luczak)\mr 97i:11007;\Zbl 868.05009.

\paper{97.06}\newb Distinct distances in finite planar sets, {\it
Discrete Math.} {\bf 175} (1997) no.~1--3, 97--132 (\fishburn)\mr
98j:52031;\Zbl 894.52007.

\paper{97.07}\newb Intersection statements for systems of sets, {\it
J. Combin. Theory Ser. A} {\bf 79} (1997) no.~1, 118--132 (\deuber;
\gunder; \kosto; \meyer)\mr 98f:05144;\Zbl 883.05123.

\paper{97.08}\newb Minimum planar sets with maximum equidistance
counts, {\it Comput. Geom.} {\bf 7} (1997) no.~4, 207--218
(\fishburn)\mr 97k:52020;\Zbl 878.68125.

\paper{97.09}\newb New Ramsey bounds from cyclic graphs of prime
order, {\it SIAM J. Discrete Math.} {\bf 10} (1997) no.~3, 381--387
(\calkin; \tovey)\mr 98e:05078;\Zbl 884.05064.

\paper{97.10}\newc  On a metric generalization of Ramsey's
theorem, {\it Israel J. Math.} {\bf 102} (1997), 283--295 (\hajnal;
\pach)\mr 99c:04004;\Zbl 884.05092.

\paper{97.11}\newb On cycles in the coprime graph of integers,
The Wilf Festschrift (Philadelphia, PA, 1996), {\it Electron. J.
Combin.} {\bf 4} (1997) no.~2, Research Paper 8, approx. 11 pp.
(electronic) (\gsark)\mr 98d:11022;\Zbl 932.11013.

\paper{97.12}\newb On infinite partitions of lines and space, {\it
Fund. Math.} {\bf 152} (1997) no.~1, 75--95 (\jackson; \mauldin)\mr
98b:03066;\Zbl 882.03031, 883.03031.

\paper{97.13}\newc On locally repeated values of certain
arithmetic functions, IV., {\it Ramanujan J.} {\bf 1} (1997) no.~3,
227--241 (\pomer; \sark)\mr 99c:11119;\Zbl 906.11048.

\paper{97.14}\newb On the best approximating ellipse containing a
plane convex body, {\it Studia Sci. Math. Hungar.} {\bf 33} (1997)
no.~1--3, 111--116 (\makai; \vincze)\mr 98d:52007;\Zbl 913.52001.

\paper{97.15}\newb On the radius of the largest ball left empty by
a Wiener process, {\it Studia Sci. Math. Hungar.} {\bf 33} (1997)
no.~1--3, 117--125 (\revesz)\mr 98g:60146;\Zbl 909.60069.

\paper{97.16}\newb Postscript, {\it The mathematics of Paul Erd\H
os, Vol. II, Algorithms Combin., 14}, pp.~575--577, Springer,
Berlin, 1997\cmp 1 425 235;\Zbl 860.01026.

\paper{97.17}\newb Primes at a (somewhat lengthy) glance, {\it
Amer. Math. Monthly} {\bf 104} (1997) no.~10, 943--945
(\agoh; \granville)\mr 99g:11012;\Zbl 923.11017.

\paper{97.18}\newc Problems in number theory, {\it New Zealand J.
Math.} {\bf 26} (1997) no.~2, 155--160\mr 99a:11001;\Zbl 938.11001.

\paper{97.19}\newc  Remarks on the $(R)$-density of sets of
numbers, II., {\it Math. Slovaca} {\bf 47} (1997) no.~5,
517--526 (\bukor; \salat; \toth)\mr 99e:11013;\Zbl 939.11005.

% NOTE:  this is not new, see 1993 pub of same name (this change
% (i.e., to remove this entry from the list) was made in the 
% 1999 update, similarly with three others in this volume)
% \paper{97.17}\newb Ramsey size linear graphs, {\it Combinatorics,
% geometry and probability (Cambridge, 1993)}, pp.~241--251,
% Cambridge Univ. Press, Cambridge, 1997 (\faud; \rous; \schelp)\cmp
% 1 476 448;\Zbl 876.05071.

\paper{97.20}\newb Some of my favorite problems and results, {\it
The mathematics of Paul Erd\H os, Vol. I, Algorithms
Combin., 13}, pp.~47--67, Springer, Berlin, 1997\mr 98e:11002;\Zbl
871.11004.

\paper{97.21}\newc Some of my favourite unsolved problems, {\it
Math. Japon.} {\bf 46} (1997) no.~3, 527--537\cmp1 487 304;\Zbl
1044.11501.

\paper{97.22}\newb Some old and new problems in various branches of
combinatorics, Graphs and combinatorics (Marseille, 1995),
{\it Discrete Math.} {\bf 165/166} (1997), 227--231\mr
98g:05001;\Zbl 872.05020.

\paper{97.23}\newb Some recent problems and results in graph
theory, The Second Krakow Conference on Graph Theory (Zgorzelisko,
1994), {\it Discrete Math.} {\bf 164} (1997) no.~1--3, 81--85\mr
97i:05065;\Zbl 871.05054.

\paper{97.24}\newb Some unsolved problems,
{\it Combinatorics, geometry and probability---A tribute to
Paul Erd\H os}, papers from the conference (Cambridge, 1993) in
honor of Erd\H os's 80th birthday, B.~Bollob\'as and A.~Thomason,
ets., pp.~1--10, Cambridge Univ. Press, Cambridge, 1997\cmp 1 476
428;\Zbl 874.11003.

\paper{97.25}\newb The factor-difference set of integers, {\it Acta
Arith.} {\bf 79} (1997) no.~4, 353--359
(\rosenfeld)\mr 98e:11025;\Zbl 896.11008.

\paper{97.26}\newb The size of the largest bipartite subgraphs,
{\it Discrete Math.} {\bf 177} (1997) no.~1--3, 267--271
(\gyarfas; \koha)\mr 98j:05084;\Zbl 888.05035.

\paper{97.27}\newb Thoughts of Pal Erdos on some Smarandache
notions, {\it Smarandache Notions Journal} {\bf 8} (1997) no.~1--3,
220--224 (\ashbacher)\mr 99e:11004;\Zbl 920.11003.

\paper{97.28}\newc Upper bounds on linear vertex-arboricity of
complementary graphs, {\it Util. Math.} {\bf 52} (1997), 43--48
(\alavi; \lam; \drlick; \jqliu; \wang)\cmp1 605 734;\Zbl 892.05023.


\year 1998

\paper{98.01}\newd A characterisation theorem of the logarithmic
function modulo 1, {\it  Pure Math. Appl.} {\bf 9}  (1998) no. 3--4,
311--318 (\ijoo; \koczy)\mr 2000g:11093;\Zbl 929.11038.

\paper{98.02}\newc Developments in non-integer bases, {\it Acta
Math. Hungar.} {\bf 79} (1998) no.~1--2, 57--83 (\komornik)\mr
99e:11132;\Zbl 906.11008.

\paper{98.03}\newd  Graphs of extremal weights, {\it  Ars
Combin.} {\bf 50}  (1998), 225--233 (\boll)\mr 99i:05102;\Zbl
963.05068. 

\paper{98.04}\newd How to decrease the diameter of triangle-free
graphs, {\it Combinatorica} {\bf 18} (1998) no.~4, 493--501
(\gyarfas; \ruszinko)\mr 2000j:05061;\Zbl 924.05038.

\paper{98.05}\newc On arithmetic properties of integers with
missing digits, I. Distribution in residue classes,  {\it  J.
Number Theory} {\bf 70} (1998) no.~2, 99--120 (\maud; \sark)\mr
99e:11127;\Zbl 923.11024.

\paper{98.06}\newc  On large values of the divisor function, Paul
Erd\H os (1913--1996), {\it Ramanujan J.} {\bf 2} (1998) no. 1--2,
225--245 (\nico; \sark)\mr 99h:11108;\Zbl 919.11060.

\paper{98.07}\newc On the sequence of numbers of the form
$\epsilon\sb 0+\epsilon\sb 1q+\cdots+\epsilon\sb nq\sp n,\,
\epsilon\sb i\in\{0,1\}$, {\it Acta Arith.} {\bf 83} (1998) no.~3,
201--210 (\ijoo; \komornik)\mr 99a:11022;\Zbl 896.11006.

\paper{98.08}\newd  Ramsey numbers for irregular graphs, Proceedings
of the Twenty-ninth Southeastern International Conference on
Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998),
{\it  Congr. Numer.} {\bf 135}  (1998), 139--145 (\gchen;
\shreve)\cmp 1 676 557;\Zbl 952.05048.

\paper{98.09}\newc  Some of my new and almost new problems and
results in combinatorial number theory, {\it Number theory (Eger,
1996)}, pp.~169--180, de Gruyter, Berlin, 1998\mr 2000a:11001;\Zbl
913.11011.

\paper{98.10}\newd  The probability method: successes and
limitations, R. C. Bose Memorial Conference (Fort Col\-lins, CO,
1995), {\it  J. Statist. Plann. Inference} {\bf 72} 
(1998) no. 1--2, 207--213\mr 2000a:05182;\Zbl 930.05096.
 

\year 1999



\paper{99.01}\newd  A selection of problems and results in
combinatorics, Recent trends in combinatorics
(M\'atrah\'aza, 1995), {\it  Combin. Probab. Comput.} {\bf 8} 
(1999) no. 1--2, 1--6; reprinted by
Cambridge Univ. Press, 2001\mr 2000b:05002;\Zbl 924.05064. 

\paper{99.02}\newc Cluster primes, {\it
Amer. Math. Monthly} {\bf 106} (1999) no.~1, 43--48
(\bleck; \selfr)\mr 2000a:11126;\Zbl 985.11041.

\paper{99.03}\newc Duplicated distances in subsets of finite planar
sets, {\it Geombinatorics} {\bf 8} (1999) no.~3,  73--77
(\fishburn)\cmp 1 664 742;\Zbl 941.52014.

\paper{99.04}\newd  Ensembles de multiples de suites finies
(Sets of multiples of finite sequences, in French), Paul
Erd\H os memorial collection, {\it  Discrete Math.} {\bf 200} 
(1999) no. 1--3, 181--203 (\tenen)\mr 2001b:11083;\Zbl 1012.11086.

\paper{99.05}\newd  Extremal graphs for weights, Paul Erd\H os
memorial collection, {\it  Discrete Math.} {\bf 200}  (1999) no.
1--3, 5--19 (\boll; \sarkar)\mr 2000j:05059;\Zbl 933.05081. 

\paper{99.06}\newd  Finding large $p$-colored
diameter two subgraphs, {\it  Graphs Combin.} {\bf 15}  (1999) no.
1, 21--27 (\tfowler)\mr 2000b:05055;\Zbl 926.05016. 

\paper{99.07}\newd  Graphs of diameter two with no $4$-circuits,
Paul Erd\H os memorial collection, {\it  Discrete Math.} {\bf 200} 
(1999) no. 1--3, 21--25 (\bondy; \fajt)\mr 2000d:05058;\Zbl
930.05051.

\paper{99.08}\newd  Greedy algorithm, arithmetic progressions,
subset sums and divisibility, Paul Erd\H os memorial collection,
{\it  Discrete Math.} {\bf 200}  (1999) no. 1--3, 119--135 (\lev;
\rauzy; \sandor; \sark)\mr 2000d:11018;\Zbl
939.11006.

\paper{99.09}\newd  Induced subgraphs of given sizes, Paul Erd\H os
memorial collection, {\it  Discrete Math.} {\bf 200}  (1999) no.
1--3, 61--77 (\furedi; \rothschild; \sos)\mr 2000g:05079;\Zbl
930.05052.

\paper{99.10}\newd Notes on sum-free and related sets, Recent
trends in combinatorics (M\'atrah\'aza, 1995), {\it Combin.
Probab. Comput.} {\bf 8}  (1999) no. 1--2, 95--107; reprinted by
Cambridge Univ. Press, 2001 (\cameron)\mr
2000c:05144;\Zbl 927.11004.

\paper{99.11}\newd   On a question about sum-free sequences, Paul
Erd\H os memorial collection, {\it  Discrete Math.} {\bf 200} 
(1999) no. 1--3,  49--54 (\deshoul; \melfi)\mr 2000f:11009;\Zbl
958.11023.

\paper{99.12}\newd  On arithmetic properties of integers
with missing digits, II., Prime factors, Paul Erd\H os memorial
collection, {\it  Discrete Math.} {\bf 200}  (1999) no. 1--3,
149--164 (\maud; \sark)\mr 2000d:11103;\Zbl
945.11006.

\paper{99.13}\newd  On the angular distribution of Gaussian
integers with fixed norm, Paul Erd\H os memorial collection, {\it 
Discrete Math.} {\bf 200}  (1999) no. 1--3, 87--94
(\rrhall)\mr 2000m:11066;\Zbl 1044.11073.

\paper{99.14}\newd  On the order of $a\ ({\rm mod\ } p)$, {\it
Number theory (Ottawa, ON, 1996), CRM Proc. Lecture Notes, 19},
pp. 87--97, Amer. Math. Soc., Providence, RI, 1999 (\mrmurty)\mr
2000c:11152;\Zbl 931.11034.

\paper{99.15}\newd  On the orders of directly indecomposable
groups, Paul Erd\H os memorial collection, {\it  Discrete Math.}
{\bf 200}  (1999) no. 1--3, 165--179 (\palfy)\mr 2000e:20037;\Zbl
939.11004.

\paper{99.16}\newd  Popular distances in $3$-space, Paul Erd\H os
memorial collection, {\it  Discrete Math.} {\bf 200}  (1999) no.
1--3, 95--99 (\harcos; \pach)\mr 2000f:52021;\Zbl 957.52006.

\paper{99.17}\newd  Prime power divisors of binomial coefficients,
Paul Erd\H os memorial collection, {\it  Discrete Math.} {\bf 200} 
(1999) no. 1--3, 101--117 (\kolesnik)\mr 2000f:11017;\Zbl
952.11002.

\paper{99.18}\newf  Restricted size Ramsey number for cycles and
stars, {\it Combinatorics, graph theory, and algorithms\/}, Vol. I,
II (Kalamazoo, MI, 1996), 353--367, New Issues Press, Kalamazoo, MI,
1999  (\faud)\cmp 1985067.

\paper{99.18}\newd  Split and balanced colorings of complete graphs,
Paul Erd\H os memorial collection, {\it  Discrete Math.} {\bf 200} 
(1999) no. 1--3, 79--86 (\gyarfas)\mr 2000e:05062;\Zbl
931.05031.

\paper{99.19}\newd  Subsets of an interval whose product is a
power, Paul Erd\H os memorial collection, {\it  Discrete Math.}
{\bf 200}  (1999) no. 1--3, 137--147 (\malouf; \selfr;
\eszek)\mr 2000e:11017;\Zbl 960.11017.

\paper{99.20}\newd  Sums of numbers with many
divisors, {\it J. Number Theory} {\bf 75}  (1999) no. 1,
1--6 (\hugh)\mr 99k:11153;\Zbl 922.11075. 

\paper{99.21}\newd  Sur les ensembles repr\'esent\'es par les
partitions d'un entier~$n$ (Sets represented by partitions of an
integer~$n$, in French), Paul Erd\H os memorial collection, {\it 
Discrete Math.} {\bf 200}  (1999) no. 1--3, 27--48 (\deleglise;
\nico)\mr 2000e:05012;\Zbl 976.11048.

\paper{99.22}\newd The number of cycle lengths in graphs of given
minimum degree and girth, Paul Erd\H os memorial collection, {\it 
Discrete Math.} {\bf 200}  (1999) no. 1--3, 55--60 (\faud;
\rous; \schelp)\mr 2000c:05086;\Zbl
934.05076.
 

\year 2000



\paper{00.01}\newe A Ramsey-type theorem for bipartite graphs,
{\it Geombinatorics} {\bf 10} (2000) no.~2, 64--68
(\hajnal; \pach)\mr 2001e:05086;\Zbl 978.05052.


\year 2001


\paper{01.01} Edge disjoint monochromatic triangles in 2-colored
graphs, {\it  Discrete Math.} {\bf 231}  (2001) no. 1--3, 135--141
(\faud;
\gould; \jacobson; \lehel)\mr 2002a:05098;\Zbl 983.05034.


\year 2002


\paper{01.01}\newf A
Ramsey-type problem and the Tur\'an numbers, {\it J. Graph Theory\/}
{\bf 40} (2002) no. 2, 120--129 (\alon; \gunder; \molloy)\mr
2003d:05139;\Zbl 996.05076.

\paper{01.01}\newf Blocking sets for paths of a given
length, {\it J. Combin. Math. Combin. Comput.\/} {\bf 40} (2002),
65--78 (\faud; \ordman; \rous; \schelp)\mr
2002m:05127;\Zbl 990.05083.

\paper{01.01}\newf On sparse sets
hitting linear forms, {\it Number theory for the millennium, I
(Urbana, IL, 2000)\/}, 257--272, A K Peters, Natick, MA, 2002
(\fanchung; \rlg)\mr 2003k:11012;\Zbl 1101.11006.

\paper{01.01}\newf Random induced graphs, {\it Discrete Math.\/} {\bf
248} (2002), no.~1--3, 249--254 (\boll; \faud; \rous; \schelp)\mr
2002m:05176;\Zbl 1038.05055.

\year 2003


\paper{03.01}\newg
On large intersecting subfamilies of uniform setfamilies,  {\it
 Random Structures Algorithms\/} {\bf
23} (2003), no.~4, 351--356 (\rduke; \rodl)\mr 2004i:05153;\Zbl
1031.05128.

\paper{03.02}\newf
On the equality of the partial Grundy and upper ochromatic numbers
of graphs,  {\it Discrete Math.\/} {\bf
272} (2003), no.~1, 53--64 (\hedet; \laskar; \prins)\mr
2004i:05048;\Zbl 1028.05031.


\paper{03.03}\newf {\it Topics in the theory of numbers\/},
translated from the second Hungarian edition by Barry Guiduli,
Undergraduate Texts in Mathematics, Springer-Verlag, New York, 2003
287~pp. (\suranyi)\mr 2003j:11001;\Zbl 1018.11001.


\year 2004

\paper{04.01}\newg On the distribution of the greatest common
divisor, A festschrift for Herman Rubin, {\it IMS Lecture Notes
Monogr. Ser.} {\bf 45}, {\it  Inst. Math. Statist., Beachwood, OH\/} 
(2004), 56--61 (\diaconis)\mr 2005m:60011.



\year 2008

\paper{07.01}\newg  On the proportion of numbers coprime to
an integer, {\it Anatomy of 
Integers\/},  CRM Proc. Lecture Notes, 46,
pp.~47--64, Amer. Math. Soc., Providence, RI, 2008 (\luca;
\pomer)\mr 2010g:11158.

%  END OF LIST



\bigskip \centerline{\bf NOTE: The total number of items in this
list is \the\papertotal.}


 
\bye