Some of My Favorite Problems and Results
Problems have always been essential part of my mathematical life. A well chosen problem can isolate an essential difficulty in a particular area, serving as a benchmark against which progress in this area can be measured. An innocent looking problem often gives no hint as to its true nature. It might be like a “marshmallow,” serving as a tasty tidbit supplying a few moments of fleeting enjoyment. Or It might be like an “acorn,” requiring deep and subtle new insights from which a mighty oak can develop.
Unable to display preview. Download preview PDF.
- B. Bollobás, Extremal Graphy Theory, Academic Press, London, 1978.Google Scholar
- P. D. T. A. Elliot, Probabilistic Number Theory I, Mean-Value Theorems, Springer-Verlag, New York, 1979.Google Scholar
- P. D. T. A. Elliot, Probabilistic Number Theory II. Central Limit Theorems, Springer-Verlag, New York, 1980.Google Scholar
- P. Erdős, On integers of the form 2k + p and some related problems, Summa Brasiliensis Math. II (1950), 113–123.Google Scholar
- P. Erdős, The Art of Counting, J. Spencer, ed., MIT Press, Cambridge, MA, 1973.Google Scholar
- P. Erdős and R. L. Graham, Old and New Problems and Results in Combinatorial Number Theory, Monograph 28, l’Enseignement Math., 1980.Google Scholar
- P. Erdos and G. Purdy, Combinatorial geometry, in Handbook of Combinatorics, R. L. Graham, M. Grötschel and L. Lovász, eds., North Holland, Amsterdam, 1994.Google Scholar
- J. Nešetřil and V. Rodi Mathematics of Ramsey Theory, Alg. and Comb. 5, Springer, New York, 1990.Google Scholar
- M. Simonovits, Extremal Graph Theory in Selected Topics in Graph Theory, L. Beineke and R. J. Wilson, eds., vol. 2, Academic Press, New York, 1983.Google Scholar