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
Student Scheduling Problem At Université de Technologie de Compiègne
TL;DR: In this paper, a MIP model was proposed to maximize the number of assignments for each student at the University of Technologie de Compiegne (UTC) while managing limited resources.
Posted Content
Stability for maximal independent sets
Jeff Kahn,Jinyoung Park +1 more
TL;DR: In this paper, Rabinovich showed that being close to the maximum implies existence of a large induced matching or triangle matching (depending on assumptions) under various restrictions, such as the existence of triangle matching in the graph.
A Method for Generating all the Prime Implicants of Binary CNF Formulas.
TL;DR: The main idea consists in using an algorithm for generating the maximal independent sets to compute all the primes implicants that cover a model to reduce the number of calls to a SAT oracle.
Posted Content
Timely Broadcasting in Erasure Networks: Age-Rate Tradeoffs
TL;DR: In this paper, a scheduling framework is proposed in which coding actions, as opposed to users, are scheduled to attain desired tradeoffs between rate and age of information (AoI).
Posted Content
Polylogarithmic Approximation Algorithms for Weighted-$\mathcal{F}$-Deletion Problems
TL;DR: A recursive scheme to obtain O(\log^{O(1)}n)$-approximation algorithms for such problems, building upon the classic technique of finding balanced separators in a graph, and believes that it can be applied to obtain many other problems as well.
References
More filters