Covering graphs by the minimum number of equivalence relations
type: Item
instance of: scholarly article
title: Covering graphs by the minimum number of equivalence relations
zbMATH Open document ID: 0646.05053
DOI: 10.1007/BF02579381
published in: Combinatorica
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C55
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4053673
zbMATH Keywords: equivalence graph
zbMATH Keywords: minimum number of equivalence subgraphs
zbMATH Keywords: minimum number of complete subgraphs
zbMATH Keywords: probabilistic arguments
Wikidata QID: Q100329040
author: Noga Alon
MaRDI profile type: Publication
cites work: An extremal problem for sets with applications to graph theory
cites work: Q3961028
cites work: The Representation of a Graph by Set Intersections
cites work: Covering Graphs by Equivalence Relations
cites work: On a clique covering problem of Orlin
cites work: Solution of a problem of A. Ehrenfeucht and J. Mycielski
cites work: Q4106341
DBLP publication ID: journals/combinatorica/Alon86a
description: scientific article; zbMATH DE number 4053673