Near-optimum Universal Graphs for Graphs with Bounded Degrees

d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel 2 Department of Mathematical Sciences, The Johns Hopkins University, 3400 N. Charles Street, Baltimore, MD 3 Instituto de Matem´atica e Estat´ıstica, Universidade de S˜ao Paulo, Brazil 4 Department of Mathematics and Computer Science, Emory University, Atlanta 5 Faculty of Mathematics and Computer Science, Adam Mickiewicz University, Pozna´n, Poland 6 Department of Computer Science, Rutgers University, NJ Let H be a family of graphs. We say that G is H-universal if, for each H ∈ H, the graph G contains a subgraph isomorphic to H. Let H(k, n) denote the family of graphs on n vertices with maximum degree at most k. For each fixed k and each n sufficiently large, we explicitly construct an H(k, n)-universal graph Γ(...

• Type: Conference
• Year: 2001
• Where: RANDOM
• Authors: Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakawa, Vojtech Rödl, Andrzej Rucinski, Endre Szemerédi
• Keywords: Computer Science, RANDOM 2001, Tel Aviv, Tel Aviv University, Theoretical Computer Science