214 citations · 235 across the 6 of their papers we have counts for
1 paper · 2 filters
Daniel Johannsen, Michael Krivelevich, Wojciech Samotij
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H in F is contained in G as a subgraph. The construction of sparse universal graphs fo…