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
On Computing Optimal Tree Ensembles
TL;DR: In this paper , the authors show that tree ensembles may need exponentially fewer cuts for increasing number of trees and that dynamic programming may also be viable for tree enambles.
Journal ArticleDOI
3-Colorability ∈ P for p6–;free Graphs
Bert Randerath,Ingo Schiermeyerb +1 more
TL;DR: In this article, it was shown that 3-colorability can be determined in polynomial time for the class of P 6 -free graphs, defined in terms of forbidden induced subgraphs.
Journal ArticleDOI
Clique problem, cutting plane proofs and communication complexity
TL;DR: In this article, it was shown that O(log n) bits of communication are enough for any n-vertex graph with maximum bipartite clique size K to identify a nonedge between A and B.
References
More filters