16 citations · 20 across the 6 of their papers we have counts for
3 papers · 1 filter
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…