Zelealem Belaineh Yilma
Carnegie Mellon University Qatar
Doha, QATAR
Email: zyilma AT qatar DOT cmu DOT edu
I am an assistant teaching professor at Carnegie Mellon Univeristy Qatar
where I teach courses in mathematics and operations research.
I completed my doctoral studies at
Carnegie Mellon University
where I was in the
ACO
(Algorithms, Combinatorics and Optimization)
program.
My advisor was Oleg Pikhurko.
I then spent one year as a postdoctoral researcher at the Laboratoire d'Informatique Algorithmique: Fondements et Applications
(LIAFA)
at Université Paris Diderot (Paris VII).
After my year in Paris, I taught for two years in the mathematics department at Addis Ababa University
before coming to my current position in Doha, Qatar.
Papers
- (with T. Jiang and O. Pikhurko)
Set Systems Without a Strong Simplex,
SIAM J Discr Math, 24 (2010) 1038-1045.
-
(with D. Bal and A. Dudek)
On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching,
Discrete Math, 311 (2011) 2577-2580.
-
(with O. Pikhurko)
The Maximum Number of K_3-Free and K_4-Free Edge 4-Colorings,
J London Math Soc, 85 (2012) 593-615.
- Antimagic Properties of Graphs with Large Maximum Degree,
J Graph Theory, 72 (2013) 367-373.
-
(with J.-S. Sereni)
A tight bound on the set chromatic number,
Discuss. Math. Graph Theory, 33 (2013) 461-465.
-
(with Tomáš Kaiser and J.-S. Sereni)
Multiple Petersen subdivisions in permutation graphs,
Electronic J. Combinatorics, 20 (2013), #P37.
-
(with D. Král', C.H.-Liu, J.-S. Sereni, and P. Whalen)
A new bound for the 2/3 conjecture,
Combinatorics, Probability and Computing, 22 (2013) 384-393.
-
(with O. Pikhurko)
Supersaturation Problem for Color-Critical Graphs,
submitted, 21pp.