报告题目：Odd induced subgraphs in a graph

报告人：宝音都仍 教授，新疆大学

报告地点：五教5101

报告时间：10月12日 上午9：20-10：00

摘要：

A graph G is called even (resp. odd) if dG(v) is even (resp. odd) for every vertex v ∈ V (G). Gallai proved that the

vertex set V (G) can be partitioned into two sets V1 and V2 such that G[Vi] is even for each i ∈ {1, 2}. This is not 

the case for the formulation of the ‘odd version’. However, Scott showed that every connected graph of an 

even order have a partition V1, . . . , Vk of V (G) such that G[Vi] is odd for any i ∈ {1, . . . , k}. In this talk, we discuss

 some new results on this topics.