Speaker: Shun-ichi Maezawa, assistant professor, Nihon University

Date: October 9, 2024

Time: 14:00-15:00

Location: Zoom Meeting: 940 9072 6856

Sponsor: School of Mathematics, Shandong University

Abstract:

An edge-colored graph is rainbow if no two edges have a same color. For two rainbow spanning trees T and T'of an edge-colored graph, we say that T' is obtained from T by an edge flip if there exist edges e and f in G such that T'=T-e+f. For an edge-colored graph G, we define the reconfiguration graph H to be the graph whose vertices correspond to rainbow spanning trees of G, and rainbow spanning trees are joined by an edge in H if and only if one is obtained from the other by a single edge flip. The reconfiguration graph is not necessarily connected. We give a condition on an edge-colored graph for its reconfiguration graph to be connected. Moreover, we found some properties of reconfiguration graphs. I will talk about our results and some open problems. This is joint work with Yutaro Yamaguchi from Osaka University.

For more information, please visit:

https://www.view.sdu.edu.cn/info/1020/195592.htm