Optimal induced universal graphs for bounded-degree graphs
2017 ◽
Vol 166
(1)
◽
pp. 61-74
◽
Keyword(s):
AbstractWe show that for any constant Δ ≥ 2, there exists a graph Γ withO(nΔ / 2) vertices which contains everyn-vertex graph with maximum degree Δ as an induced subgraph. For odd Δ this significantly improves the best-known earlier bound and is optimal up to a constant factor, as it is known that any such graph must have at least Ω(nΔ/2) vertices.
2008 ◽
Vol 108
(5)
◽
pp. 255-260
◽
Keyword(s):
Keyword(s):
2013 ◽
Vol 22
(2)
◽
pp. 253-281
◽
Keyword(s):
Keyword(s):
2011 ◽
Vol Vol. 13 no. 1
(Graph and Algorithms)
◽
2012 ◽
Vol 21
(1-2)
◽
pp. 229-253
◽
Keyword(s):
2010 ◽
Vol 19
(5-6)
◽
pp. 693-709
◽
Keyword(s):