-
A new bound for the 2/3 conjecture
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... -
On $({K}\_{q},k)$ stable graphs with small $k$
International audience -
On $({K}\_{q},k)$ vertex stable graphs with minimum size
International audience -
On (K_{q},k) stable graphs with small k
Version soumise à publication
