Loading Events

« All Events

:

Casey Tompkins, On graphs without cycles of length 0 modulo 4

April 2 Tuesday @ 4:30 PM - 5:30 PM KST

Room B332, IBS (기초과학연구원)

Speaker

Casey Tompkins
Alfréd Rényi Institute of Mathematics
https://dimag.ibs.re.kr/home/tompkins/

Bollobás proved that for every $k$ and $\ell$ such that $k\mathbb{Z}+\ell$ contains an even number, an $n$-vertex graph containing no cycle of length $\ell \bmod k$ can contain at most a linear number of edges. The precise (or asymptotic) value of the maximum number of edges in such a graph is known for very few pairs $\ell$ and $k$. We precisely determine the maximum number of edges in a graph containing no cycle of length $0 \bmod 4$.
This is joint work with Ervin Győri, Binlong Li, Nika Salia, Kitti Varga and Manran Zhu.

Details

Date:
April 2 Tuesday
Time:
4:30 PM - 5:30 PM KST
Event Category:
Event Tags:

Venue

Room B332
IBS (기초과학연구원) + Google Map

Organizer

Sang-il Oum (엄상일)
View Organizer Website
IBS 이산수학그룹 Discrete Mathematics Group
기초과학연구원 수리및계산과학연구단 이산수학그룹
대전 유성구 엑스포로 55 (우) 34126
IBS Discrete Mathematics Group (DIMAG)
Institute for Basic Science (IBS)
55 Expo-ro Yuseong-gu Daejeon 34126 South Korea
E-mail: dimag@ibs.re.kr, Fax: +82-42-878-9209
Copyright © IBS 2018. All rights reserved.