A universal graph is a type of graph that contains all possible graphs of a certain type as subgraphs. More formally, a universal graph for a particular set of labeled graphs is a graph that includes every graph (or every isomorphism class of graphs) on a fixed number of vertices as a subgraph. For example, one well-known concept is the universal graph for finite graphs, which can contain all possible simple graphs on a finite set of vertices.
Articles by others on the same topic
There are currently no matching articles.