✦ LIBER ✦

On decomposition of triangle-free graphs under degree constraints

✍ Scribed by Kaneko, Atsushi

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 80 KB
Volume: 27
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199801)27:1<7::aid-jgt2>3.0.co;2-u

No coin nor oath required. For personal study only.

✦ Synopsis

We prove that if s and t are positive integers and if G is a triangle-free graph with minimum degree s + t, then the vertex set of G has a decomposition into two sets which induce subgraphs of minimum degree at least s and t, respectively.