## Events Search and Views Navigation

## August 2019

### Mihyun Kang (강미현), The genus of a random graph and the fragile genus property

In this talk we shall discuss how quickly the genus of the Erdős-Rényi random graph grows as the number of edges increases and how dramatically a small number of random edges can increase the genus of a randomly perturbed graph. (Joint work with Chris Dowden and Michael Krivelevich)

Find out more »## September 2019

### Cory Palmer, A survey of Turán-type subgraph counting problems

Let $F$ and $H$ be graphs. The subgraph counting function $\operatorname{ex}(n,H,F)$ is defined as the maximum possible number of subgraphs $H$ in an $n$-vertex $F$-free graph. This function is a direct generalization of the Turán function as $\operatorname{ex}(n,F)=\operatorname{ex}(n,K_2,F)$. The systematic study of $\operatorname{ex}(n,H,F)$ was initiated by Alon and Shikhelman in 2016 who generalized several classical results in extremal graph theory to the subgraph counting setting. Prior to their paper, a number of individual cases were investigated; a well-known example is…

Find out more »## October 2019

### Alexandr V. Kostochka, On Ramsey-type problems for paths and cycles in dense graphs

A well-known Ramsey-type puzzle for children is to prove that among any 6 people either there are 3 who know each other or there are 3 who do not know each other. More generally, a graph $G$ arrows a graph $H$ if for any coloring of the edges of $G$ with two colors, there is a monochromatic copy of $H$. In these terms, the above puzzle claims that the complete $6$-vertex graph $K_6$ arrows the complete $3$-vertex graph $K_3$. We consider sufficient…

Find out more »### Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs

A graph or graph property is $\ell$-reconstructible if it is determined by the multiset of all subgraphs obtained by deleting $\ell$ vertices. Apart from the famous Graph Reconstruction Conjecture, Kelly conjectured in 1957 that for each $\ell\in\mathbb N$, there is an integer $n=n(\ell)$ such that every graph with at least $n$ vertices is $\ell$-reconstructible. We show that for each $n\ge7$ and every $n$-vertex graph $G$, the degree list and connectedness of $G$ are $3$-reconstructible, and the threshold $n\geq 7$ is sharp for both properties. We…

Find out more »### The 2nd East Asia Workshop on Extremal and Structural Graph Theory

The 2nd East Asia Workshop on Extremal and Structural Graph Theory is a workshop to bring active researchers in the field of extremal and structural graph theory, especially in the East Asia such as China, Japan, and Korea. Date Oct 31, 2019 (Arrival Day) - Nov 4, 2019 (Departure Day) Venue and Date UTOP UBLESS Hotel, Jeju, Korea (유탑유블레스호텔제주) Address: 502 Johamhaean-ro, Jocheon-eup, Jeju, Korea (제주특별자치도 제주시 조천읍 조함해안로 502) We plan to support the accommodation for invited participants. The…

Find out more »## June 2020

### Seymour is Seventy

A conference honouring the seventieth birthday of Paul Seymour To be held in ENS de Lyon, France, June 15 - 19, 2020 Conference Website: https://dimag.ibs.re.kr/seymour70/ Sponsors: IBS Discrete Mathematics Group. LIP, ENS de Lyon, France. Department of Mathematics, Princeton University.

Find out more »