𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Edge disjoint spanning trees in random graphs

✍ Scribed by A. M. Frieze; T. Łuczak

Publisher
Springer Netherlands
Year
1990
Tongue
English
Weight
145 KB
Volume
21
Category
Article
ISSN
0031-5303

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Embedding k(n−k) edge-disjoint spanning
Embedding k(n−k) edge-disjoint spanning trees in arrangement graphs
✍ Chin-Tsai Lin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 278 KB

The arrangement graphs are a class of generalized star graphs. In this paper we construct a graph that consists of the maximum number of directed edge-disjoint spanning trees in an arrangement graph. The paths that connect the common root node to any given node through different spanning trees are n

A Property on Edge-disjoint Spanning Tre
A Property on Edge-disjoint Spanning Trees
✍ Hong-Jian Lai; Hongyuan Lai; Charles Payan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Let G be a simple graph with n vertices and let G c denote the complement of G . Let ( G ) denote the number of components of G and G ( E ) the spanning subgraph of G with edge set E . where the minimum is taken over all such partitions . In [ Europ . J . Combin . 7 (1986) , 263 -270] , Payan conj

Edge disjoint Steiner trees in graphs wi
Edge disjoint Steiner trees in graphs without large bridges
✍ Matthias Kriesell 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB

## Abstract A set __A__ of vertices of an undirected graph __G__ is called __k__‐__edge‐connected in G__ if for all pairs of distinct vertices __a, b__∈__A__, there exist __k__ edge disjoint __a, b__‐paths in __G__. An __A__‐__tree__ is a subtree of __G__ containing __A__, and an __A__‐__bridge__ i