Random induced graphs
نویسندگان
چکیده
Given a monotone graphical property Q, how large should d(n) be to ensure that if (Hn) is any sequence of graphs satisfying |Hn| = n and (Hn)¿d(n), then almost every induced subgraph of Hn has property Q? We prove essentially best possible results for the following monotone properties: (i) k-connected for :xed k, (ii) Hamiltonian. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Hereditarily Extended Properties, Quasi-Random Graphs and not Necessarily Induced Subgraphs
Recently nmch at tent ion has been focused on the theory of quasi-random graph and hypergraph properties. The class of quasi-random graphs is defined by certain equivalent graph properties possessed by random graphs. We shall investigate properties P which do not imply quasi-randomness for sequences (Gn) of graphs on their own, but do imply if they hold not only for the whole graph Gn but also ...
متن کاملPercolation with small clusters on random graphs
We consider the problem of finding an induced subgraph in a random dregular graph such that its components have bounded size as the size of the graph gets arbitrarily large. We show that for any threshold τ , the largest size density of such an induced subgraph with component sizes bounded by τ is at most 2(log d)/d for asymptotically large d. A matching lower bound is known for independent set...
متن کاملEnumeration of P 4-Free Chordal Graphs
We count labelled chordal graphs with no induced path of length 3, both exactly and asymptotically. These graphs correspond to rooted trees in which no vertex has exactly one child, and each vertex has been expanded to a clique. Some properties of random graphs of this type are also derived. The corresponding unlabelled graphs are in 1-1 correspondence with unlabelled rooted trees on the same n...
متن کاملMatchings in Random Biregular Bipartite Graphs
We study the existence of perfect matchings in suitably chosen induced subgraphs of random biregular bipartite graphs. We prove a result similar to a classical theorem of Erdős and Rényi about perfect matchings in random bipartite graphs. We also present an application to commutative graphs, a class of graphs that are featured in additive number theory.
متن کاملA zero-one law for the existence of triangles in random key graphs
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles i...
متن کاملExcluding induced subgraphs: Critical graphs
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with chromatic number k + 1 almost all graphs not containing H as a subgraph are k-colorable if and only if H contains a color-critical edge. We strengthen the concept of H-free to induced subgraph containment, proving that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 248 شماره
صفحات -
تاریخ انتشار 2002