| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6424549 | Journal of Combinatorial Theory, Series B | 2015 | 63 Pages |
Abstract
The clique number of a graph is the size of its maximum clique. We say that the pair (B,R) is additive if for every XâV, the sum of the clique numbers of B|X and R|X is at least the clique number of G(B,R)|X. Our second result is a sufficient condition for additivity of pairs of graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Ron Aharoni, Eli Berger, Maria Chudnovsky, Juba Ziani,