Dyck's map (3, 7)8 is a counterexample to a clique covering conjecture

A. Vince, Steve Wilson

Research output: Contribution to journalArticlepeer-review


Let c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A counterexample is provided to a conjecture communicated by P. Erdo{combining double acute accent}s. If c(G - e) < c(G) for every edge e, then G contains no triangles.

Original languageEnglish (US)
Pages (from-to)157-160
Number of pages4
JournalJournal of Combinatorial Theory, Series B
Issue number1
StatePublished - Jan 1992

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics


Dive into the research topics of 'Dyck's map (3, 7)<sub>8</sub> is a counterexample to a clique covering conjecture'. Together they form a unique fingerprint.

Cite this