报告题目: Inducibility problems for discrete structures
报告人: Hao Huang (Institute for Mathematics and its Applications, UMN)
报告时间：8月3号）16:00-17:00
报告地点：1218
摘要:
Induciblity problems have been studied for more than four centuries, and have connections to diverse areas of pure and applied mathematics.
These problems generally ask the following question: how many patterns of a certain type can occur in a structure of a given size? In this talk,
we will start by surveying inducibility problems for various discrete structures including graphs, digraphs and permutations. Then we will discuss
our new results, which give solutions to two well-studied combinatorial problems, Pippenger and Golumbic's graph inducibility problem
from 1975 and Wilf's permutation packing problem from 1992, for almost all instances.
This talk is based on joint works with Jacob Fox and Choongbum Lee.
欢迎感兴趣的师生前来参加！
