✦ LIBER ✦

The Isoperimetric Number of Random Regular Graphs

✍ Scribed by Bollobás, Bélla

Book ID: 123078849
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 247 KB
Volume: 9
Category: Article
ISSN: 0195-6698
DOI: 10.1016/S0195-6698(88)80014-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Regular Honest Graphs, Isoperimetric Num

Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs

✍ Noga Alon; Peter Hamburger; Alexandr V. Kostochka 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 243 KB

The number of matchings in random regula

The number of matchings in random regular graphs and bipartite graphs

✍ B Bollobás; B.D McKay 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Isoperimetric numbers of graph bundles

✍ Jin Ho Kwak; Jaeun Lee; Moo Young Sohn 📂 Article 📅 1996 🏛 Springer Japan 🌐 English ⚖ 712 KB

The generalized acyclic edge chromatic n

The generalized acyclic edge chromatic number of random regular graphs

✍ Stefanie Gerke; Catherine Greenhill; Nicholas Wormald 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB 👁 1 views

## Abstract The __r__‐acyclic edge chromatic number of a graph is defined to be the minimum number of colors required to produce an edge coloring of the graph such that adjacent edges receive different colors and every cycle __C__ has at least min(|__C__|, __r__) colors. We show that (__r__ − 2)__d

Computing the isoperimetric number of a

Computing the isoperimetric number of a graph

✍ P. A. Golovach 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 279 KB

Distribution of the number of spanning r

Distribution of the number of spanning regular subgraphs in random graphs

✍ Pu Gao 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 170 KB