Minimal Universal Bipartite Graphs

13 years 4 months ago
Minimal Universal Bipartite Graphs
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with minimum number of vertices for various classes of bipartite graphs: exponential classes of bipartite (and general) graphs, bipartite chain graphs, bipartite permutation graphs, and general bipartite graphs. For exponential classes and general bipartite graphs we present a construction which is asymptotically optimal while for the other classes our solutions are optimal in order.
Vadim V. Lozin, Gábor Rudolf
Added 08 Dec 2010
Updated 08 Dec 2010
Type Journal
Year 2007
Authors Vadim V. Lozin, Gábor Rudolf
Comments (0)