𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The minimum degree threshold for perfect graph packings

✍ Scribed by Daniela Kühn; Deryk Osthus

Book ID
106167709
Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
822 KB
Volume
29
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum degree thresholds for bipartite
Minimum degree thresholds for bipartite graph tiling
✍ Albert Bush; Yi Zhao 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 361 KB

## Abstract Given a bipartite graph __H__ and a positive integer __n__ such that __v__(__H__) divides 2__n__, we define the minimum degree threshold for bipartite __H__‐tiling, δ~2~(__n, H__), as the smallest integer __k__ such that every bipartite graph __G__ with __n__ vertices in each partition

Minimum degree games for graphs
Minimum degree games for graphs
✍ Daniel M. Gordon; Robert W. Robinson; Frank Harary 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 792 KB
Graph decomposition with constraints on
Graph decomposition with constraints on the minimum degree
✍ John Sheehan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 888 KB

Let G be a finite simple graph on n vertices with minimum degree 6(G) 3 6 (n = 6 (mod 2)). Let max(k, G) denote the set of all k-subsets A E V(G) such that the number of edges in the induced subgraph (A) is a maximum. We prove that for some i E (0, 1.2, . . . ). Analogous edge density constraints, r

The minimum degree of Ramsey-minimal gra
The minimum degree of Ramsey-minimal graphs
✍ Jacob Fox; Kathy Lin 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract We write __H__ → __G__ if every 2‐coloring of the edges of graph __H__ contains a monochromatic copy of graph __G__. A graph __H__ is __G__‐__minimal__ if __H__ → __G__, but for every proper subgraph __H__′ of __H__, __H__′ ↛ __G__. We define __s__(__G__) to be the minimum __s__ such th

Overfull conjecture for graphs with high
Overfull conjecture for graphs with high minimum degree
✍ Michael Plantholt 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 79 KB

## Abstract Chetwynd and Hilton showed that any regular graph __G__ of even order __n__ which has relatively high degree $\Delta (G)\,\ge\,((\sqrt{7}- 1)/2)\, n$ has a 1‐factorization. This is equivalent to saying that under these conditions __G__ has chromatic index equal to its maximum degree $\D