Codeforces Round #684 (Div. 2) Graph Subset Problem
题目链接You are given an undirected graph with nnn vertices and mmm edges. Also, you are given an integer kkk.Find either a clique of size kkk or a non-empty subset of vertices such that each vertex of this subset has at least kkk neighbors in the subset
