Covering graphs by the minimum number of equivalence relations
- 90 Downloads
An equivalence graph is a vertex disjoint union of complete graphs. For a graphG, let eq(G) be the minimum number of equivalence subgraphs ofG needed to cover all edges ofG. Similarly, let cc(G) be the minimum number of complete subgraphs ofG needed to cover all its edges. LetH be a graph onn vertices with maximal degree ≦d (and minimal degree ≧1), and letG=\(\bar H\) be its complement. We show that
The lower bound is proved by multilinear techniques (exterior algebra), and its assertion for the complement of ann-cycle settles a problem of Frankl. The upper bound is proved by probabilistic arguments, and it generalizes results of de Caen, Gregory and Pullman.
$$\log _2 n - \log _2 d \leqq eq(G) \leqq cc(G) \leqq 2e^2 (d + 1)^2 \log _e n.$$
AMS subject classification (1980)68 E 10 68 E 05 05 B 25 05 C 55
Unable to display preview. Download preview PDF.
- D. de Caen, D. A. Gregory andN. J. Pullman, Clique coverings of complements of paths and cycles,Annals of Discrete Math, to appear.Google Scholar
- P. Duchet,Représentations, noyaux en théorie des graphes et hypergraphes, Thése de doctoral d’Etat, Université Paris VI (1979).Google Scholar
- P. Erdős, A. W. Goodman andL. Pósa, The representation of a graph by set intersections,Can. J. Math. 18 (1966), 106–112.Google Scholar
© Akadémiai Kiadó 1986