学术报告( Boram Park, Shinya Fujita 1.7)

离散数学学术报告两场

发布人:周妍 发布日期:2018-12-13
主题
离散数学学术报告两场
活动时间
-
活动地址
数学楼416讲学厅
主讲人
Boram Park副教授(Ajou University), Shinya Fujita副教授(Yokohama City University)

一、3点至4

 

Boram Park (韩国Ajou University)

Unavoidable subgraphs in a graph with large matching number

 

Given a graph parameter ρ, every graph G with sufficiently large ρ(G) contains a well-structured induced subgraph H with large ρ(H). The classical Ramseys theorem deals with the case when the graph parameter under consideration is the number of vertices; there is also a Ramsey-type theorem regarding connected graphs. In other words, Ramseys theorem is for unavoidable structures in a graph with large number of vertices.

 

Given a graph G, the matching number and the induced matching number of G is the maximum size of a matching and an induced matching, respectively, of G. In this paper, we formulate Ramsey-type theorems for the matching number and the induced matching number regarding connected graphs. Along the way, we obtain a Ramsey-type theorem for the independence number regarding connected graphs as well. The work is based on joint work with Ilkyoo Choi, Michitaka Furuya, and Ringi Kim.

 

 

二、4点到5

 

 Shinya Fujita (日本 Yokohama City University)

 Some recent results on edge-colored graphs

 

An edge-colored graph is called properly colored if no two adjacent edges have the same color. Also, an edge-colored graph is called rainbow if no color repeats on it. Nowadays, properly colored cycles or rainbow cycles in edge-colored graphs are widely studied in graph theory. In this talk, some recent results on properly colored cycles and rainbow cycles will be reviewed. I will also present some open problems in this topic.

 

数学学院

2018年12月13日