Clique covering of graphs
type: Item
instance of: scholarly article
title: Clique covering of graphs
zbMATH Open document ID: 0641.05030
DOI: 10.1007/BF02579265
published in: Combinatorica
publication date: 1986-01-01T00:00:00Z
review text: The clique covering number cc(G) of a graph G is the least number of complete subgraphs of G necessary to cover the edge set of G. The author shows that there exists an integer \(n_ 0\) such that for all graphs G on \(n>n_ 0\) vertices \(\max \{cc(G)+cc(\bar G)\}=\lfloor n^ 2/4\rfloor +2.\) This settles a conjecture of Erdős.
reviewed by: Ortrud R. Oellermann
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 4043874
zbMATH Keywords: clique covering number
author: Laszló Pyber
MaRDI profile type: Publication
cites work: Extremal clique coverings of complementary graphs
cites work: The Representation of a Graph by Set Intersections
cites work: Q3313890
full work available at URL: https://doi.org/10.1007/bf02579265
OpenAlex ID: W2017711450
description: scientific article; zbMATH DE number 4043874