3 citations · 6 across the 5 of their papers we have counts for
1 paper · 1 filter
Jinyu Zou, Yaping Mao, Colton Magnant +2
Given a graph G and a positive integer k, the \emph{Gallai-Ramsey number} is defined to be the minimum number of vertices n such that any k-edge coloring of Kn contains…