Spanning Maximal Planar Subgraphs of Random Graphs
نویسندگان
چکیده
We study the threshold for the existence of a spanning maximal planar subgraph in the random graph Gn . We show that it is very near p = ~TTOWe also discuss the threshold for the existence of a spanning maximal outerplanar subgraph. This is very near
منابع مشابه
Maximal Planar Subgraphs of Fixed Girth in Random Graphs
In 1991, Bollobás and Frieze showed that the threshold for Gn,p to contain a spanning maximal planar subgraph is very close to p = n−1/3. In this paper, we compute similar threshold ranges for Gn,p to contain a maximal bipartite planar subgraph and for Gn,p to contain a maximal planar subgraph of fixed girth g.
متن کاملThe sizes of maximal planar, outerplanar, and bipartite planar subgraphs
We deene the subvariance S P (F) of a family of graphs F with respect to property P to be the innmum of the ratio jH1j jH2j , where H 1 and H 2 are any two maximal spanning subgraphs of G with property P, and where G is a member of F. It is shown that, for the family of all connected graphs, the subvariance when P is planar, outerplanar, and bipartite planar, is 1=3, 1=2, and 1=2, respectively.
متن کاملTrees and Matchings
In this article, Temperley’s bijection between spanning trees of a subgraph of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of an associated subgraph of the square grid on the other, is extended to the setting of general planar directed (and undirected) graphs, where edges carry nonnegative weights that induce a weighting on the set of spanning trees. W...
متن کاملSeries-parallel subgraphs of planar graphs
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected (respectively, 2-edge-connected) spanning partial 2-tree (seriesparallel) graph. In contrast, a recent result by [4] implies that not all 3-connected graphs contain 2-edge-connected series-parallel spanning subgraphs.
متن کاملApproximate Minimum 2-Connected Subgraphs in Weighted Planar Graphs
We consider the problems of finding the minimum-weight 2-connected spanning subgraph in edge-weighted planar graphs and its variations. We first give a PTAS for the problem of finding minimum-weight 2-edge-connected spanning subgraphs where duplicate edges are allowed. Then we present a new greedy spanner construction for edge-weighted planar graphs. From this we derive quasi-polynomial time ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 2 شماره
صفحات -
تاریخ انتشار 1991