Zelealem B. Yilma, Ph.D.
Affiliations: | 2011 | Carnegie Mellon University, Pittsburgh, PA |
Area:
Mathematics, Applied MathematicsGoogle:
"Zelealem Yilma"Parents
Sign in to add mentorOleg Pikhurko | grad student | 2011 | Carnegie Mellon | |
(Results in Extremal Graph and Hypergraph Theory.) |
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. |
Pikhurko O, Staden K, Yilma ZB. (2017) The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques Arxiv: Combinatorics. 163: 341-356 |
Pikhurko O, Yilma ZB. (2017) Supersaturation problem for color-critical graphs Journal of Combinatorial Theory, Series B. 123: 148-185 |
KRNC M, SERENI JS, ŠKREKOVSKI R, et al. (2016) Closeness centralization measure for two-mode data of prescribed sizes Network Science. 1-17 |
Sereni JS, Yilma ZB. (2013) A tight bound on the set chromatic number Discussiones Mathematicae - Graph Theory. 33: 461-465 |
Kaiser T, Sereni JS, Yilma ZB. (2013) Multiple Petersen subdivisions in permutation graphs Electronic Journal of Combinatorics. 20 |
Král' D, Liu CH, Sereni JS, et al. (2013) A new bound for the 2/3 conjecture Combinatorics Probability and Computing. 22: 384-393 |
Yilma ZB. (2013) Antimagic properties of graphs with large maximum degree Journal of Graph Theory. 72: 367-373 |
Pikhurko O, Yilma ZB. (2012) The maximum number of K 3-free and K 4-free edge 4-colorings Journal of the London Mathematical Society. 85: 593-615 |
Bal D, Dudek A, Yilma ZB. (2011) On the maximum number of edges in a hypergraph with a unique perfect matching Discrete Mathematics. 311: 2577-2580 |
Jiang T, Pikhurko O, Yilma Z. (2010) Set Systems without a Strong Simplex Siam Journal On Discrete Mathematics. 24: 1038-1045 |