Speaker : Dr. Wu-Hsiung Lin (National Chiao Tung University)
Title : b-coloring of tight bipartite graphs and the Erdos-Faber-Lovasz Conjecture
Time : 2013-06-07 (Fri) 14:00 -
Place : Seminar Room 617, Institute of Mathematics (NTU Campus)
Abstract: The b-chromatic number of a graph is the maximum for which there is a function such that for any edge , and for every there exists a vertex assigned adjacent to some vertex assigned for any . In general, , where is the maximum degree of and is the largest integer such that has at least vertices of degree at least . A graph is tight if there are exactly vertices of degree and all other vertices have degree less than . This paper discusses a relation between b-chromatic numbers of tight bipartite graphs and the Erds-Faber-Lovasz Conjecture. (Joint work with Gerard. J Chang)