#### Parents

Sign in to add mentorLipót (Leopold) Fejér | grad student | 1934 | University of Budapest | |

(Über die Primzahlen gewisser arithmetischer Reihen) |

#### Children

Sign in to add traineeBela 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 collaboratorJanos Aczel | collaborator | ||

Miklos Ajtai | collaborator | IBM Research (Computer Science Tree) | |

Mark Goldberg | collaborator | (Epi Tree) |

BETA: Related publications

See more...

#### 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. |

Erdos P, Rényi A. (2011) On the evolution of random graphs The Structure and Dynamics of Networks. 38-82 |

Erdös P, Meir A, Sós VT, et al. (2006) On some applications of graph theory, I Discrete Mathematics. 306: 853-866 |

Duke RA, Erdos P, Rödl V. (2003) On Large Intersecting Subfamilies of Uniform Setfamilies Random Structures and Algorithms. 23: 351-356 |

Erdos P, Faudree RJ, Gould RJ, et al. (2001) Edge disjoint monochromatic triangles in 2-colored graphs Discrete Mathematics. 231: 135-141 |

Erdos P, Faudree RJ, Rousseau CC, et al. (1999) The number of cycle lengths in graphs of given minimum degree and girth Discrete Mathematics. 200: 55-60 |

Bondy JA, Erdos P, Fajtlowicz S. (1999) Graphs of diameter two with no 4-circuits Discrete Mathematics. 200: 21-25 |

Erdos P, Montgomery HL. (1999) Sums of Numbers with Many Divisors Journal of Number Theory. 75: 1-6 |

Erdos P, Fowler T. (1999) Finding large p-colored diameter two subgraphs Graphs and Combinatorics. 15: 21-27 |

Erdos P. (1999) A Selection of Problems and Results in Combinatorics Combinatorics Probability and Computing. 8: 1-6 |

Cameron PJ, Erdos P. (1999) Notes on Sum-Free and Related Sets Combinatorics Probability and Computing. 8: 95-107 |