Zelealem Belaineh Yilma
LIAFA
Université Paris Diderot
Paris, FRANCE
Email: zelealem DOT yilma AT liafa DOT jussieu DOT fr
Office: 6A35
I am a postdoctoral researcher at the
"Laboratoire d'Informatique Algorithmique: Fondements et Applications" (LIAFA)
laboratory of Université Paris Diderot (Paris VII).
I was previously in the
ACO
(Algorithms, Combinatorics and Optimization)
PhD program at Carnegie Mellon University.
My advisor was Oleg Pikhurko.
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,
to appear in J London Math Soc, 24pp.
- Antimagic Properties of Graphs with Large Maximum Degree,
to apper in J Graph Theory, 7pp.
-
(with O. Pikhurko)
Supersaturation Problem for Color-Critical Graphs,
submitted, 21pp.
-
(with J.-S. Sereni)
A tight bound on the set chromatic number,
submitted, 3pp.