16 citations · 20 across the 6 of their papers we have counts for
6 papers
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…
The Erdős-Rothschild problem on edge-colourings with forbidden monochromatic cliques
Oleg Pikhurko, Katherine Staden, Zelealem B. Yilma
Let be a sequence of natural numbers. For a graph , let denote the number of colourings of the edges of with colours $1,\do…
Supersaturation Problem for Color-Critical Graphs
Oleg Pikhurko, Zelealem B. Yilma
The \emph{Turán function} $\ex(n,F)$ of a graph is the maximum number of edges in an -free graph with vertices. The classical results of Turán and Rademacher from 1941 l…
Multiple Petersen subdivisions in permutation graphs
Tomáš Kaiser, Jean-Sébastien Sereni, Zelealem Yilma
A permutation graph is a cubic graph admitting a 1-factor M whose complement consists of two chordless cycles. Extending results of Ellingham and of Goldwasser and Zhang, we prove…
A new bound for the 2/3 conjecture
Daniel Král', Chun-Hung Liu, Jean-Sébastien Sereni +2
We show that any n-vertex complete graph with edges colored with three colors contains a set of at most four vertices such that the number of the neighbors of these vertices in one…
On the Maximum Number of Edges in a Hypergraph with a Unique Perfect Matching
Deepak Bal, Andrzej Dudek, Zelealem B. Yilma
In this note, we determine the maximum number of edges of a -uniform hypergraph, , with a unique perfect matching. This settles a conjecture proposed by Snevily.