Multiple vertex coverings by specified induced subgraphs
Combinatorics
2007-05-23 v1
Abstract
Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of H_i. When k=2 and one graph is an independent set of size n, we determine the optimum within a constant. When k=2 and the graphs are a star and an independent set, we determine the answer exactly.
Keywords
Cite
@article{arxiv.math/9912188,
title = {Multiple vertex coverings by specified induced subgraphs},
author = {Zoltan Furedi and Dhruv Mubayi and Douglas B. West},
journal= {arXiv preprint arXiv:math/9912188},
year = {2007}
}
Comments
10 pages, 3 figures