Graphs and Matroids Seminar- Gal Kronenberg
Title: 2-universality of random graphs.
Speaker: | Gal Kronenberg |
Affiliation: | Tel Aviv University |
Room: | *MC 6486* |
Abstract: For a family of graphs F, a graph G is F-universal if G contains every graph in F as a (not necessarily induced) subgraph.