The 13th KMGS will be held on November 3rd, Thursday, at Natural Science Building (E6-1) Room 1501.
We invite a speaker Seonghyuk Im (임성혁) from the Dept. of Mathematical Sciences, KAIST.
The abstract of the talk is as follows.
Slot (AM 11:50~PM 12:30)
[Speaker] Seonghyuk Im (임성혁) from Dept. of Mathematical Sciences, KAIST, supervised by Prof. Jaehoon Kim (김재훈 교수님)
[Title] Large clique subdivisions in graphs without small dense subgraphs
[Discipline] Combinatorics
[Abstract] In extremal graph theory, one big question is finding a condition of the number of edges that guarantees the existence of a particular substructure in a graph. In the first half of this talk, I’ll talk about the history of such problems, especially focusing on clique subdivisions. In the last half of the talk, I’ll introduce my recent result with Jaehoon Kim, Younjin Kim, and Hong Liu, which states that if a graph G has no dense small subgraph, then G has a clique subdivision of size almost linear in its average degree and discuss some applications and further open questions.
[Language] Korean (English if it is requested)