Paul (Pál) Erdős

Affiliations: 
 
Area:
Mathematics
Google:
"Paul Erdős"
Bio:

Nexus of the Erdős number

Parents

Sign in to add mentor
Lipót (Leopold) Fejér grad student 1934 University of Budapest
 (Über die Primzahlen gewisser arithmetischer Reihen)

Children

Sign in to add trainee
Bela Bollobas grad student 1967 Eötvös Loránd University
Ernst Niebur grad student 1983-1988 Université de Lausanne (Neurotree)

Collaborators

Sign in to add collaborator
Janos Aczel collaborator
Miklos Ajtai collaborator IBM Research (Computer Science Tree)
Mark Goldberg collaborator (Epi Tree)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Bollobás B, Erdős P, Faudree R, et al. (2002) Random induced graphs Discrete Mathematics. 248: 249-254
Erdos P. (1997) Some recent problems and results in graph theory Discrete Mathematics. 164: 81-85
Bollobás B, Erdos P, Spencer J, et al. (1993) Clique coverings of the edges of a random graph Combinatorica. 13: 1-5
Niebur E, Erdös P. (1991) Theory of the locomotion of nematodes: Dynamics of undulatory progression on a surface. Biophysical Journal. 60: 1132-46
Niebur E, Erdos P. (1991) Theory of the locomotion of nematodes. Dynamics of undulatory progression on a surface Biophysical Journal. 60: 1132-1146
Niebur E, Erdos P. (1988) Computer simulation of the motor-neural system of a simple invertebrate Neural Networks. 1: 350
Erdős P. (1988) Problems and results in combinatorial analysis and graph theory Discrete Mathematics. 72: 81-92
Erdós P, Goldberg M, Pach J, et al. (1988) Cutting a graph into two dissimilar halves Journal of Graph Theory. 12: 121-131
Alavi Y, Chartrand G, Chung FRK, et al. (1987) Highly irregular graphs Journal of Graph Theory. 11: 235-249
Erdös P. (1986) Two problems in extremal graph theory Graphs and Combinatorics. 2: 189-190
See more...