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
Posted Content
Extremal edge polytopes
Tuan Tran,Günter M. Ziegler +1 more
TL;DR: In this article, the maximum number of vertices of k-neighborly edge polytopes up to a sublinear term was determined for k = 2, 3, 5.
Interpretation-driven Visual Association.
TL;DR: This paper outlines ongoing research into a computational model of association based on the reinterpretation of a source object to fit the target and preliminary results of visual associations made by the system in a simple shape domain.
Posted Content
Enumerating k-Vertex Connected Components in Large Graphs
TL;DR: This paper proves the upper bound of the number of partitions, which implies the polynomial running time algorithm for the k-VCC enumeration, and proposes two effective optimization strategies, namely neighbor sweep and group sweep, to significantly reduce thenumber of local connectivity testings.
Journal ArticleDOI
On a problem of Katona on minimal separating systems
TL;DR: The smallest number f(n) for which there exists a family of subsets of S{A"1, A"2,...,A"f"("n")} with the following property is determined.
Journal ArticleDOI
Frame field smoothness-based approach for hex-dominant meshing
TL;DR: An indirect approach for building hex-dominant meshes is proposed: a tetrahedral mesh is constructed at first and is recombined to create a maximum amount of hexahedra, and a frame field smoothness-based algorithm for bulk point insertion is proposed.
References
More filters