Let G n,m,k denote the space of simple graphs with n vertices, m edges, and minimum degree at least k, each graph G being equiprobable. Let G have property A k , if G contains (k -1)/2 edge disjoint Hamilton cycles, and, if k is even, a further edge disjoint matching of size n/2 . We prove that, for
Random graphs of binomial type with sparsely-edged initial graphs
✍ Scribed by A. Ruciński
- Publisher
- Akadmiai Kiad
- Year
- 1986
- Tongue
- English
- Weight
- 374 KB
- Volume
- 47
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
TkSE, M., Shortness coefficients of simple 3-polytopal graphs with edges of only two types, Discrete Mathematics 103 (1992) 103-110. We consider two classes of simple 3-polytopal graphs whose edges are incident with either two S-gons or a 5-gon and q-gon (q = 26 or 27). We show that the shortness c
We consider the class of pentagonal 3-polytopal graphs all of whose edges are incident either with two 3-valent vertices or with a 3-valent vertex and a q-valent vertex. For most values of q, (i) we find a small non-hamiltonian graph in the class and (ii) we show that the shortness exponent of the c
We consider classes of simple 3-polytopal graphs whose edges are incident with either two 5-gons or a 5-gon and a q-gon (q > 5). We show that the shortness coefficient is less than one for all q 1> 28, settle a question raised by Jendrol and Tk~i~ in a recent paper in this journal and prove that all
It is shown that, if q >/29 and q ~ 0 (mod 3), the infinite class of 5-regular 3-polytopal graphs whose edges are incident with either two triangles or a triangle and a q-gon contains nonhamiltonian members and even has shortness exponent less than one.