Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Pinyin
i2Cantonese
i2Cangjie
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SODA

2008

ACM

2008

ACM

Let H be a finite family of graphs. A graph G is H-universal if it contains a copy of each H H as a subgraph. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For all admissible k and n, we construct an H(k, n)-universal graph G with at most ckn2- 2 k edges, where ck is a constant depending only on k. This is optimal, up to the constant factor ck, as it is known that ckn2-2/k is a lower bound for the number of edges in any such graph. The construction of G is explicit, and there is an efficient deterministic algorithm for finding a copy of any given H H(k, n) in G.

Related Content

Added |
30 Oct 2010 |

Updated |
30 Oct 2010 |

Type |
Conference |

Year |
2008 |

Where |
SODA |

Authors |
Noga Alon, Michael R. Capalbo |

Comments (0)