It is known that, for every constant k 3, the presence of a k-clique (a complete subgraph on k vertices) in an n-vertex graph cannot be detected by a monotone boolean circuit usi...
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
For a non-negative integer T, we prove that the independence number of a graph G = (V, E) in which every vertex belongs to at most T triangles is at least uV f(d(u), T) where d(u)...
A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique...
Flavia Bonomo, Maria Chudnovsky, Guillermo Dur&aac...
: Let G be a graph on n vertices in which every induced subgraph on s = log3 n vertices has an independent set of size at least t = log n. What is the largest q = q(n) so that ever...