2019 Combinatorics Workshop
The annual conference on Combinatorics Workshop (조합론 학술대회) began in 2004 by the Yonsei University BK21 Research Group. This year it will take place in Songdo, Incheon, August 13-15, 2019. …
10 events found.
Events
-
-
Hotel Skypark, Songdo, Incheon, Korea (송도 스카이파크호텔) -
Mihyun Kang (강미현), The genus of a random graph and the fragile genus property
Room B232 IBS (기초과학연구원)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 …
-
-
Kevin Hendrey, The minimum connectivity forcing forest minors in large graphs
Room B232 IBS (기초과학연구원)Given a graph $G$, we define $\textrm{ex}_c(G)$ to be the minimum value of $t$ for which there exists a constant $N(t,G)$ such that every $t$-connected graph with at least $N(t,G)$ …
-
Cory Palmer, A survey of Turán-type subgraph counting problems
Room B232 IBS (기초과학연구원)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 …
-
-
Casey Tompkins, Extremal problems for Berge hypergraphs
Room B232 IBS (기초과학연구원)Given a graph $G$, there are several natural hypergraph families one can define. Among the least restrictive is the family $BG$ of so-called Berge copies of the graph $G$. In …
-
Alexandr V. Kostochka, On Ramsey-type problems for paths and cycles in dense graphs
Room 1501, Bldg. E6-1, KAISTA 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 …
-
Alexandr V. Kostochka, Reconstructing graphs from smaller subgraphs
Room B232 IBS (기초과학연구원)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 …
-
Zi-Xia Song (宋梓霞), Ramsey numbers of cycles under Gallai colorings
Room B232 IBS (기초과학연구원)For a graph $H$ and an integer $k\ge1$, the $k$-color Ramsey number $R_k(H)$ is the least integer $N$ such that every $k$-coloring of the edges of the complete graph $K_N$ …
-
Joonkyung Lee (이준경), On some properties of graph norms
Room B232 IBS (기초과학연구원)For a graph $H$, its homomorphism density in graphs naturally extends to the space of two-variable symmetric functions $W$ in $L^p$, $p\geq e(H)$, denoted by $t_H(W)$. One may then define …
-
Extremal and Structural Graph Theory (2019 KMS Annual Meeting)
Room 426, Hong-Mun Hall, Hongik University, SeoulFocus Session @ 2019 KMS Annual MeetingA focus session "Extremal and Structural Graph Theory" at the 2019 KMS Annual Meeting is organized by Sang-il Oum. URL: http://www.kms.or.kr/meetings/fall2019/SpeakersIlkyoo Choi (최일규), Hankuk University of …