Clique Partitions and Clique Coverings

P. Erdős, Ralph Faudree, Edward T. Ordman

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph. For a graph on n vertices, the clique partition number can grow end times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between cna vertices are deleted,1/2≤a≤1, then the number of cliques needed to partition what is left is asymptotic to c2n2a; this fills in a gap between results of Wallis for a≤1/2 and Pullman and Donald for a=1, c≥1/2. Clique coverings of a clique minus a matching are also investigated.

Original languageEnglish
Pages (from-to)93-101
Number of pages9
JournalAnnals of Discrete Mathematics
Volume38
Issue numberC
DOIs
Publication statusPublished - 1988

Fingerprint

Clique
Covering
Partition
Covering number
Clique number
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Cite this

Clique Partitions and Clique Coverings. / Erdős, P.; Faudree, Ralph; Ordman, Edward T.

In: Annals of Discrete Mathematics, Vol. 38, No. C, 1988, p. 93-101.

Research output: Contribution to journalArticle

Erdős, P. ; Faudree, Ralph ; Ordman, Edward T. / Clique Partitions and Clique Coverings. In: Annals of Discrete Mathematics. 1988 ; Vol. 38, No. C. pp. 93-101.
@article{dc8279d000264983b60749991117d2b0,
title = "Clique Partitions and Clique Coverings",
abstract = "Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph. For a graph on n vertices, the clique partition number can grow end times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between cna vertices are deleted,1/2≤a≤1, then the number of cliques needed to partition what is left is asymptotic to c2n2a; this fills in a gap between results of Wallis for a≤1/2 and Pullman and Donald for a=1, c≥1/2. Clique coverings of a clique minus a matching are also investigated.",
author = "P. Erdős and Ralph Faudree and Ordman, {Edward T.}",
year = "1988",
doi = "10.1016/S0167-5060(08)70774-X",
language = "English",
volume = "38",
pages = "93--101",
journal = "Annals of Discrete Mathematics",
issn = "0167-5060",
publisher = "Elsevier",
number = "C",

}

TY - JOUR

T1 - Clique Partitions and Clique Coverings

AU - Erdős, P.

AU - Faudree, Ralph

AU - Ordman, Edward T.

PY - 1988

Y1 - 1988

N2 - Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph. For a graph on n vertices, the clique partition number can grow end times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between cna vertices are deleted,1/2≤a≤1, then the number of cliques needed to partition what is left is asymptotic to c2n2a; this fills in a gap between results of Wallis for a≤1/2 and Pullman and Donald for a=1, c≥1/2. Clique coverings of a clique minus a matching are also investigated.

AB - Several new tools are presented for determining the number of cliques needed to (edge-)partition a graph. For a graph on n vertices, the clique partition number can grow end times as fast as the clique covering number, where c is at least 1/64. If in a clique on n vertices, the edges between cna vertices are deleted,1/2≤a≤1, then the number of cliques needed to partition what is left is asymptotic to c2n2a; this fills in a gap between results of Wallis for a≤1/2 and Pullman and Donald for a=1, c≥1/2. Clique coverings of a clique minus a matching are also investigated.

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

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

U2 - 10.1016/S0167-5060(08)70774-X

DO - 10.1016/S0167-5060(08)70774-X

M3 - Article

VL - 38

SP - 93

EP - 101

JO - Annals of Discrete Mathematics

JF - Annals of Discrete Mathematics

SN - 0167-5060

IS - C

ER -