Clique–coclique methods and spectral bounds for strongly regular graphs
최고관리자
2026-02-25
-
분야
콜로퀴움
-
날짜
20260327 ~ 20260327시간
15:00 ~ 17:00 -
장소
Math. Bldg. #404
초청자
-
연사
Jongyook Park
소속
Kyungpook National University
-
제목
Clique–coclique methods and spectral bounds for strongly regular graphs
-
소개 및 안내사항
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)
