: For two given graphs G1 and G2, the Ramsey number R(G1, G2) is the smallest integer n such that for any graph G of order n, either G contains G1 or the complement of G contains G...
T. C. Edwin Cheng, Yaojun Chen, Yunqing Zhang, C. ...
: Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function rf (a1,a2, ...,ak) as an extension of the classical definition for Ramsey numbers. They determined an e...
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
Marcus Weber, Wasinee Rungsarityotin, Alexander Sc...
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...