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
12th Cologne-Twente workshop on graphs and combinatorial optimization (CTW 2013)
Johann L. Hurink,Bodo Manthey +1 more
Journal ArticleDOI
Some bounds on the size of maximum G-free sets in graphs
TL;DR: In this paper , the authors studied the generalized version of the independence number of a graph and gave some bounds about the size of the maximum $G$-free subset of graphs, which is another purpose of this article.
Journal ArticleDOI
Computing Dense and Sparse Subgraphs of Weakly Closed Graphs
TL;DR: In this paper , it was shown that the problem of finding dense subgraphs, such as the enumeration of bicliques and s -plexes, is fixed-parameter tractable with respect to $$\gamma (G)$$.
Journal ArticleDOI
Blocker size via matching minors
TL;DR: This work generalises the aforementioned results to clutters and leads to polynomial algorithms for restricted instances of many problems including Set Cover and k-SAT.
Book ChapterDOI
On Compression of Machine-Derived Context Sets for Fusion of Multi-modal Sensor Data
TL;DR: A graph-theoretic approach and a subset selection approach are proposed for the controlled reduction of contexts to obtain a context set of lower cardinality, and an upper bound on the error introduced by the compression is derived.
References
More filters