—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
For p 1, we prove that every forest with p trees whose sizes are a1, . . . , ap can be embedded in any graph containing at least p i=1(ai + 1) vertices and having minimum degree ...
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
Let S be a set of points in the plane. What is the minimum possible dilation of all plane graphs that contain S? Even for a set S as simple as five points evenly placed on the ci...