— We consider the situation where users rank items from a given set, and each user ranks only a (small) subset of all items. We assume that users can be classified into C classe...
The vertex Folkman number F(r, n, m), n < m, is the smallest integer t such that there exists a Km-free graph of order t with the property that every r-coloring of its vertices...
Adding cuts based on copositive matrices, we propose to improve Lov´asz’ bound θ on the clique number and its tightening θ introduced by McEliece, Rodemich, Rumsey, and Schri...
Immanuel M. Bomze, Florian Frommlet, Marco Locatel...
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
A clique is a set of pairwise adjacent vertices in a graph. We determine the maximum number of cliques in a graph for the following graph classes: (1) graphs with n vertices and m ...