### Abstract

Giving a partial solution to a conjecture of Balas and Yu [Networks 19 (1989) 247–235], we prove that if the complement of a graph G on n vertices contains no set of t + 1 pairwise disjoint edges as an induced subgraph, then G has fewer than (n/2t)^{2t} maximal complete subgraphs. © 1993 by John Wiley & Sons, Inc.

Original language | English |
---|---|

Pages (from-to) | 207-210 |

Number of pages | 4 |

Journal | Networks |

Volume | 23 |

Issue number | 3 |

DOIs | |

Publication status | Published - Jan 1 1993 |

### ASJC Scopus subject areas

- Information Systems
- Computer Networks and Communications

## Cite this

Farber, M., Hujter, M., & Tuza, Z. (1993). An upper bound on the number of cliques in a graph.

*Networks*,*23*(3), 207-210. https://doi.org/10.1002/net.3230230308