Disjoint cliques and disjoint maximal independent sets of vertices in graphs

P. Erdős, Arthur M. Hobbs, C. Payan

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this paper, we find lower bounds for the maximum and minimum numbers of cliques in maximal sets of pairwise disjoint cliques in a graph. By complementation, these yield lower bounds for the maximum and minimum numbers of independent sets in maximal sets of pairwise disjoint maximal independent sets of vertices in a graph. In the latter context, we show by examples that one of our bounds is best possible.

Original languageEnglish
Pages (from-to)57-61
Number of pages5
JournalDiscrete Mathematics
Volume42
Issue number1
DOIs
Publication statusPublished - 1982

Fingerprint

Maximal Independent Set
Clique
Pairwise
Disjoint
Lower bound
Complementation
Graph in graph theory
Independent Set
Context

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Disjoint cliques and disjoint maximal independent sets of vertices in graphs. / Erdős, P.; Hobbs, Arthur M.; Payan, C.

In: Discrete Mathematics, Vol. 42, No. 1, 1982, p. 57-61.

Research output: Contribution to journalArticle

Erdős, P. ; Hobbs, Arthur M. ; Payan, C. / Disjoint cliques and disjoint maximal independent sets of vertices in graphs. In: Discrete Mathematics. 1982 ; Vol. 42, No. 1. pp. 57-61.
@article{a27ed2c70241474694ead631a4d82ccf,
title = "Disjoint cliques and disjoint maximal independent sets of vertices in graphs",
abstract = "In this paper, we find lower bounds for the maximum and minimum numbers of cliques in maximal sets of pairwise disjoint cliques in a graph. By complementation, these yield lower bounds for the maximum and minimum numbers of independent sets in maximal sets of pairwise disjoint maximal independent sets of vertices in a graph. In the latter context, we show by examples that one of our bounds is best possible.",
author = "P. Erdős and Hobbs, {Arthur M.} and C. Payan",
year = "1982",
doi = "10.1016/0012-365X(82)90053-X",
language = "English",
volume = "42",
pages = "57--61",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1",

}

TY - JOUR

T1 - Disjoint cliques and disjoint maximal independent sets of vertices in graphs

AU - Erdős, P.

AU - Hobbs, Arthur M.

AU - Payan, C.

PY - 1982

Y1 - 1982

N2 - In this paper, we find lower bounds for the maximum and minimum numbers of cliques in maximal sets of pairwise disjoint cliques in a graph. By complementation, these yield lower bounds for the maximum and minimum numbers of independent sets in maximal sets of pairwise disjoint maximal independent sets of vertices in a graph. In the latter context, we show by examples that one of our bounds is best possible.

AB - In this paper, we find lower bounds for the maximum and minimum numbers of cliques in maximal sets of pairwise disjoint cliques in a graph. By complementation, these yield lower bounds for the maximum and minimum numbers of independent sets in maximal sets of pairwise disjoint maximal independent sets of vertices in a graph. In the latter context, we show by examples that one of our bounds is best possible.

UR - http://www.scopus.com/inward/record.url?scp=49049130485&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049130485&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(82)90053-X

DO - 10.1016/0012-365X(82)90053-X

M3 - Article

AN - SCOPUS:49049130485

VL - 42

SP - 57

EP - 61

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1

ER -