Zelealem B. Yilma

activity

20112016

most citedThe Erdős-Rothschild problem on edge-colourings with forbidden monochromatic cliques

16 citations · 20 across the 6 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016★ 1 cited

Closeness Centralization Measure for Two-mode Data of Prescribed Sizes

Matjaž Krnc, Jean-Sébastien Sereni, Riste Škrekovski +1

We confirm a conjecture by Everett, Sinclair, and Dankelmann~[Some Centrality results new and old, J. Math. Sociology 28 (2004), 215--227] regarding the problem of maximizing close…

math.CO2016★ 16 cited

The Erdős-Rothschild problem on edge-colourings with forbidden monochromatic cliques

Oleg Pikhurko, Katherine Staden, Zelealem B. Yilma

Let $k := (k_{1}, \dots, k_{s})$ be a sequence of natural numbers. For a graph $G$ , let $F (G; k)$ denote the number of colourings of the edges of $G$ with colours $1,\do…