𝔖 Bobbio Scriptorium
✦   LIBER   ✦

One-factor in random graphs based on vertex choice

✍ Scribed by E. Shamir; E. Upfal

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
541 KB
Volume
41
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

The following result is proved: Consider a random graph on n vertices where each ?'zitex chooses randomIy a set of c neigh~rs.

If c 26, then the graph has a l-factor, with probability + 1 as tt ---, ~0.

πŸ“œ SIMILAR VOLUMES

One-factorizations of complete graphs wi
One-factorizations of complete graphs with vertex-regular automorphism groups
✍ Arrigo Bonisoli; Domenico Labbate πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 161 KB

## Abstract We consider one‐factorizations of __K__~2__n__~ possessing an automorphism group acting regularly (sharply transitively) on vertices. We present some upper bounds on the number of one‐factors which are fixed by the group; further information is obtained when equality holds in these boun

On the factorization of graphs with exac
On the factorization of graphs with exactly one vertex of infinite degree
✍ FranΓ§ois Bry πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 355 KB

We give a necessary and suflicient exactly one vertex of infinite degree. condition for the existence of a l-factor in graphs with ## 1. Illmmdon The following well-known necessary and sufficient condition for the existence of a l-factor in locally

On packing 3-vertex paths in a graph
On packing 3-vertex paths in a graph
✍ Atsushi Kaneko; Alexander Kelmans; Tsuyoshi Nishimura πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 276 KB πŸ‘ 2 views