𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On disjoint crossing families in geometric graphs

✍ Scribed by Radoslav Fulek; Andrew Suk

Book ID
119236582
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
190 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Disjoint Hamilton cycles in the random g
Disjoint Hamilton cycles in the random geometric graph
✍ Tobias MΓΌller,; Xavier PΓ©rez-GimΓ©nez;; Nicholas Wormald πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 270 KB

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge-length. For fixed k β‰₯ 1, we prove that the first edge in the process that creates a k-connected graph coincides a.a.s. with

On disjoint configurations in infinite g
On disjoint configurations in infinite graphs
✍ Thomas Andreae πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 87 KB

## Abstract For a graph __A__ and a positive integer __n__, let __nA__ denote the union of __n__ disjoint copies of __A__; similarly, the union of β„΅~0~ disjoint copies of __A__ is referred to as β„΅~0~__A__. It is shown that there exist (connected) graphs __A__ and __G__ such that __nA__ is a minor o

On disjoint matchings in cubic graphs
On disjoint matchings in cubic graphs
✍ Vahan V. Mkrtchyan; Samvel S. Petrosyan; Gagik N. Vardanyan πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 562 KB