BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv5.1.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200225T163000
DTEND;TZID=Asia/Seoul:20200225T173000
DTSTAMP:20200716T045223
CREATED:20200217T133320Z
LAST-MODIFIED:20200629T005916Z
UID:2129-1582648200-1582651800@dimag.ibs.re.kr
SUMMARY:Xin Zhang (张欣)\, On the equitable tree-coloring of graphs with low degeneracy
DESCRIPTION:A (vertex) $k$-coloring of a graph $G$ is a tree-coloring if each color class induces a forest\, and is equitable if the sizes of any two color classes differ by at most 1. The first relative result concerning the equitable tree-coloring of graphs is due to H. Fan\, H. A. Kierstead\, G. Liu\, T. Molla\, J.-L. Wu\, and X. Zhang (2011)\, who proved that any graph with maximum degree at most $\Delta$ has a $\Delta$-coloring so that each color class induces a graph with maximum degree at most 1. After that\, many results on this topic were published in the literature. For example\, L. Esperet\, L. Lemoine\, and F. Maffray (2015) showed that any planar graph admits an equitable tree-$k$-coloring for every integer $k\ge 4$，and G. Chen\, Y. Gao\, S. Shan\, G. Wang\, and J.-L. Wu (2017) proved that any 5-degenerate graph with maximum degree at most $\Delta$ admits an equitable tree-$k$-coloring for every $k\geq \lceil\frac{\Delta+1}{2}\rceil$. \nIn this talk\, we review part of the known results and the conjectures on the equitable tree-coloring of graphs\, and then show the sketch proofs of our three new results as follows: \n(a) the vertex set of any graph $G$ can be equitably partitioned into $k$ subsets for any integer $k\geq\max\{\lceil\frac{\Delta(G)+1}{2}\rceil\,\lceil\frac{|G|}{4}\rceil\}$ so that each of them induces a linear forest; \n(b) any plane graph with independent crossings admits an equitable tree-$k$-coloring for every integer $k\ge 8$; \n(c) any $d$-degenerate graph with maximum degree at most $\Delta$ admits an equitable tree-$k$-coloring for every integer $k\geq (\Delta+1)/2$ provided that $\Delta\geq 10d$. \nThis is a joint work with Yuping Gao\, Bi Li\, Yan Li\, and Bei Niu. \n
URL:https://dimag.ibs.re.kr/event/2020-02-25/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR