Publications of Erdős, P.

Export all publications as EndNote XML

Combinatorics, probability & computing. Győri E, Erdős P, Sós VT, editors. Cambridge: Cambridge University Press; 1999.

Győri E, Faudree R, Erdős P. On the book size of graphs with large minimum degree. Studia Scientiarum Mathematicarum Hungarica. 1995;30(1-2):25-46.

Győri E, Erdős P, Simonovits M. How many edges should be deleted to make a triangle-free graph bipartite? In: Halász G, editor. Sets, graphs and numbers : a birthday salute to Vera T. Sós and András Hajnal. Amsterdam: North-Holland; 1992. p. 239-63. (Colloquia mathematica Societatis János Bolyai; no 60).

Proceedings of the Colloquium held at Tihany, Hungary, September. Vol 1966. Erdős P, Katona GOH, editors. New York: Academic Press; 1968.

Katona GO. A theorem of finite sets. In: Erdős P, Katona GOH, editors. Theory of Graphs. Budapest: Akadémia Kiadó; 1968. p. 187-207.

Katona GO, Korvin G. Functions defined on a directed graph. In: Erdős P, Katona GOH, editors. Theory of Graphs. New York: Academic Press; 1968. p. 209-13.