Clique–coclique methods and spectral bounds for strongly regular graphs
최고관리자
2026-02-25
-
Category
Seminar
-
Date
20260327 ~ 20260327Time
15:00 ~ 17:00 -
Place
Math. Bldg. #404
Host
-
Speaker
Jongyook Park
Affiliation
Kyungpook National University
-
Subject
Clique–coclique methods and spectral bounds for strongly regular graphs
-
Notice
Title: Clique–coclique methods and spectral bounds for strongly regular graphs
Speaker: Jongyook Park(Kyungpook National University)
Abstract: Strongly regular graphs play an important role in algebraic combinatorics and are closely connected with finite geometry and design theory. A basic problem is to understand which parameter sets of strongly regular graphs can actually occur.
In this talk we discuss several results obtained using spectral methods together with structural information about cliques and cocliques. In particular, we explain how eigenvalue constraints interact with the combinatorial structure of large cliques and with cocliques in local graphs, and how these ideas lead to restrictions on the parameters of strongly regular graphs.This is based on joint works with Jack H. Koolen, Chenhui Lv and Greg Markowsky.
.png)
