Clique Partitions of Chordal Graphs

P. Erdős, Edward T. Ordman, Yechezkel Zalcstein

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

To partition the edges of a chordal graph on n vertices into cliques may require as many as n2/6 cliques; there is an example requiring this many, which is also a threshold graph and a split graph. It is unknown whether this many cliques will always suffice. We are able to show that (1 − c)n2/4 cliques will suffice for some c > 0.

Original languageEnglish
Pages (from-to)409-415
Number of pages7
JournalCombinatorics Probability and Computing
Volume2
Issue number4
DOIs
Publication statusPublished - 1993

Fingerprint

Chordal Graphs
Clique
Partition
Threshold Graph
Split Graph
Unknown

ASJC Scopus subject areas

  • Applied Mathematics
  • Theoretical Computer Science
  • Statistics and Probability
  • Computational Theory and Mathematics

Cite this

Clique Partitions of Chordal Graphs. / Erdős, P.; Ordman, Edward T.; Zalcstein, Yechezkel.

In: Combinatorics Probability and Computing, Vol. 2, No. 4, 1993, p. 409-415.

Research output: Contribution to journalArticle

Erdős, P. ; Ordman, Edward T. ; Zalcstein, Yechezkel. / Clique Partitions of Chordal Graphs. In: Combinatorics Probability and Computing. 1993 ; Vol. 2, No. 4. pp. 409-415.
@article{7e19bcc7647c4d0e8100a2a16b00c41b,
title = "Clique Partitions of Chordal Graphs",
abstract = "To partition the edges of a chordal graph on n vertices into cliques may require as many as n2/6 cliques; there is an example requiring this many, which is also a threshold graph and a split graph. It is unknown whether this many cliques will always suffice. We are able to show that (1 − c)n2/4 cliques will suffice for some c > 0.",
author = "P. Erdős and Ordman, {Edward T.} and Yechezkel Zalcstein",
year = "1993",
doi = "10.1017/S0963548300000808",
language = "English",
volume = "2",
pages = "409--415",
journal = "Combinatorics Probability and Computing",
issn = "0963-5483",
publisher = "Cambridge University Press",
number = "4",

}

TY - JOUR

T1 - Clique Partitions of Chordal Graphs

AU - Erdős, P.

AU - Ordman, Edward T.

AU - Zalcstein, Yechezkel

PY - 1993

Y1 - 1993

N2 - To partition the edges of a chordal graph on n vertices into cliques may require as many as n2/6 cliques; there is an example requiring this many, which is also a threshold graph and a split graph. It is unknown whether this many cliques will always suffice. We are able to show that (1 − c)n2/4 cliques will suffice for some c > 0.

AB - To partition the edges of a chordal graph on n vertices into cliques may require as many as n2/6 cliques; there is an example requiring this many, which is also a threshold graph and a split graph. It is unknown whether this many cliques will always suffice. We are able to show that (1 − c)n2/4 cliques will suffice for some c > 0.

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

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

U2 - 10.1017/S0963548300000808

DO - 10.1017/S0963548300000808

M3 - Article

AN - SCOPUS:84971790715

VL - 2

SP - 409

EP - 415

JO - Combinatorics Probability and Computing

JF - Combinatorics Probability and Computing

SN - 0963-5483

IS - 4

ER -