Journal ArticleDOI
On cliques in graphs
J. W. Moon,L. Moser +1 more
Reads0
Chats0
TLDR
In this article, the maximum number of cliques possible in a graph with n nodes is determined and bounds are obtained for the number of different sizes of clique possible in such a graph.Abstract:
A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined. Also, bounds are obtained for the number of different sizes of cliques possible in such a graph.read more
Citations
More filters
Journal ArticleDOI
An Improved Exact Algorithm for Knot-Free Vertex Deletion
TL;DR: The fastest known exact algorithm for KFVD runs in time O(mathcal{O}^\star(1.576^n) as discussed by the authors , where n is the number of vertices in a directed graph.
Proceedings Article
Counting homomorphisms in plain exponential time
TL;DR: In the counting graph homomorphism problem (#GraphHomomorphism), the question is: given graphs G,H, find the number of homomorphisms from G to H as discussed by the authors.
Posted Content
Maximal independent sets in clique-free graphs
TL;DR: In this paper, the maximum number of maximal independent sets (MISs) of size (n/k) in an n-vertex graph can be asymptotic to the extremal construction of a disjoint union of k-cliques with sizes as close to n/k$ as possible.
References
More filters