Ebadollah S. Mahmoodian
Ebadollah S. Mahmoodian (born 18 May 1943 in Zanjan, Iran) is a retired professor of mathematics at the Mathematical Sciences Department of Sharif University of Technology.[1]
He received his Bachelor of Science in 1965 at University of Tehran and his master's degree in 1968 at Shiraz University. He got a Master's and a PhD degree from the University of Pennsylvania in 1971 and 1975, respectively. His thesis advisor were Albert Nijenhuis and Herbert Wilf. He was a professor of mathematics at the Mathematical Sciences Department of Sharif University of Technology since 1983.[1][2] He co-edited Combinatorics Advances.[3]
Mahmoodian has contributions in graph theory, in particular graph colouring.[4] He has also worked on combinatorial designs, in particular, defining sets, and the relations between all those areas.[5] Mahmoodian is also known for mentoring and research collaborations with Maryam Mirzakhani during her studies at Sharif University.
References
- ^ a b "E. S. Mahmoodian". sharif.ir. Retrieved 2017-03-22.
- ^ "Ebadollah Mahmoodian – The Mathematics Genealogy Project". www.genealogy.math.ndsu.nodak.edu. Retrieved 2017-03-22.
- ^ Charles J. Colbourn; Ebadollah S. Mahmoodian, eds. (1995). Combinatorics Advances. Dordrecht: Kluwer Academic Publishers Group.
{{cite book}}:|work=ignored (help) - ^ Mahmoodian, E.S; Naserasr, Reza; Zaker, Manouchehr (1997). "Defining sets in vertex colorings of graphs and latin rectangles". Discrete Mathematics. 167–168: 451–60. doi:10.1016/S0012-365X(96)00247-6.
- ^ "DIMACS – RUTGERS EXPERIMENTAL MATHEMATICS SEMINAR". dimacs.rutgers.edu. Retrieved 2017-03-25.
Further reading
- Mahmoodian, Ebadollah S.; Rezaie, M.; Vatan, F. (March 1987). "Generalization of Venn Diagram" (PDF). Eighteenth Annual Iranian Mathematics Conference. Tehran and Isfahan, Iran. Archived from the original (PDF) on 2017-05-01. Retrieved 2017-05-01.
External links
See what we do next...
OR
By submitting your email or phone number, you're giving mschf permission to send you email and/or recurring marketing texts. Data rates may apply. Text stop to cancel, help for help.
Success: You're subscribed now !