Zelealem B. Yilma, Ph.D. - Publications
Affiliations: | 2011 | Carnegie Mellon University, Pittsburgh, PA |
Area:
Mathematics, Applied MathematicsYear | Citation | Score | |||
---|---|---|---|---|---|
2017 | Pikhurko O, Staden K, Yilma ZB. The Erdős–Rothschild problem on edge-colourings with forbidden monochromatic cliques Arxiv: Combinatorics. 163: 341-356. DOI: 10.1017/S0305004116001031 | 0.651 | |||
2017 | Pikhurko O, Yilma ZB. Supersaturation problem for color-critical graphs Journal of Combinatorial Theory, Series B. 123: 148-185. DOI: 10.1016/J.Jctb.2016.12.001 | 0.631 | |||
2016 | KRNC M, SERENI JS, ŠKREKOVSKI R, YILMA ZB. Closeness centralization measure for two-mode data of prescribed sizes Network Science. 1-17. DOI: 10.1017/Nws.2016.14 | 0.316 | |||
2013 | Sereni JS, Yilma ZB. A tight bound on the set chromatic number Discussiones Mathematicae - Graph Theory. 33: 461-465. DOI: 10.7151/Dmgt.1679 | 0.431 | |||
2013 | Kaiser T, Sereni JS, Yilma ZB. Multiple Petersen subdivisions in permutation graphs Electronic Journal of Combinatorics. 20. DOI: 10.37236/2239 | 0.457 | |||
2013 | Král' D, Liu CH, Sereni JS, Whalen P, Yilma ZB. A new bound for the 2/3 conjecture Combinatorics Probability and Computing. 22: 384-393. DOI: 10.1017/S0963548312000612 | 0.573 | |||
2013 | Yilma ZB. Antimagic properties of graphs with large maximum degree Journal of Graph Theory. 72: 367-373. DOI: 10.1002/Jgt.21664 | 0.532 | |||
2012 | Pikhurko O, Yilma ZB. The maximum number of K 3-free and K 4-free edge 4-colorings Journal of the London Mathematical Society. 85: 593-615. DOI: 10.1112/Jlms/Jdr031 | 0.66 | |||
2011 | Bal D, Dudek A, Yilma ZB. On the maximum number of edges in a hypergraph with a unique perfect matching Discrete Mathematics. 311: 2577-2580. DOI: 10.1016/J.Disc.2011.07.016 | 0.444 | |||
2010 | Jiang T, Pikhurko O, Yilma Z. Set Systems without a Strong Simplex Siam Journal On Discrete Mathematics. 24: 1038-1045. DOI: 10.1137/090760775 | 0.56 | |||
Show low-probability matches. |