题目: Progress and problems on graph packing

报告人: Gexin Yu 教授, 威廉玛丽意昂4

摘要: Two graphs of same number of vertices pack if they can be embedded in the same vertex set so that the resulting graph is simple. Alternatively, two graphs pack if and only if one graph is a subgraph of the complement of the other graph. Many extremal graph theory problems can be stated naturally in terms of graph packing. In this talk, I will mainly talk about the recent progress on graph packing in terms of degree conditions. Some open problems will be mentioned as well.

时间: 6月3日(周四)15:30

地点: 致远楼107

欢迎参加！