𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Induced-Universal Graphs for Graphs with Bounded Maximum Degree

✍ Scribed by Steve Butler

Publisher
Springer Japan
Year
2009
Tongue
English
Weight
213 KB
Volume
25
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Induced Ramsey Numbers for Graphs wit
On Induced Ramsey Numbers for Graphs with Bounded Maximum Degree
✍ Tomasz Łuczak; VojtΔ›ch RΓΆdl πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 435 KB

For graphs G and H we write G wΓ„ ind H if every 2-edge colouring of G yields an induced monochromatic copy of H. The induced Ramsey number for H is defined as r ind (H)=min[ |V(G)|: G wΓ„ ind H]. We show that for every d 1 there exists an absolute constant c d such that r ind (H n, d ) n cd for every

Decompositions of graphs into forests wi
Decompositions of graphs into forests with bounded maximum degree
✍ MirosΕ‚aw TruszczyΕ„ski πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 995 KB

Truszczydski, M., Decompositions of graphs into forests with bounded maximum degree, Discrete Mathematics 98 (1991) 207-222.

Total interval number for graphs with bo
Total interval number for graphs with bounded degree
✍ Kostochka, Alexander V.; West, Douglas B. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 90 KB πŸ‘ 2 views

The total interval number of an n-vertex graph with maximum degree βˆ† is at most (βˆ†+1/βˆ†)n/2, with equality if and only if every component of the graph is K βˆ†,βˆ† . If the graph is also required to be connected, then the maximum is βˆ†n/2 + 1 when βˆ† is even, but when βˆ† is odd it exceeds [βˆ† + 1/(2.5βˆ† + 7.7