Vertex Arboricity of Planar Graphs

Date:2023-04-14Clicks:224设置

Speaker: Professor Wang Yiqiao

Topic: Vertex Arboricity of Planar Graphs

Date: April 18, 2023

Time: 7:00 - 8:00 p.m.

Tencent Meeting ID: 923832011

Sponsors: School of Mathematics and Statistics, Research Institute of Mathematical Science, Institute of Science and Technology

Biography:

Wang Yiqiao, a professor from Beijing University of Chinese Medicine, is a doctoral supervisor, Associate Dean of the School of Management, and a director of the Graphs and Combinatorics Optimization of the Operations Research Society of China. She graduated from the Academy of Mathematics and Systems Science of the Chinese Academy of Sciences. She has hosted two projects of the National Natural Science Foundation of China, and was selected for the “Young Scientists Scheme of Beijing University of Chinese Medicine in 2019”. Prof. Wang has also published papers in SIAM DM, DAM and some international journals.

Abstract:

The vertex-arboricity a(G) of a graph G is the minimum number of subsets into which the set of vertices of G can be partitioned so that each subset induces a forest. In this talk, we give a survey on the research progress of the vertex-arboricity and list vertex-arboricity of graphs. We show that every planar graph G without adjacent 3-cycles has a(G)≤2, which resolves a conjecture of Raspaud and Wang in 2008.

返回原图
/