Ringi Kim (김린기), The strong clique number of graphs with forbidden cycles
Room B232 IBS (기초과학연구원)The strong clique number of a graph $G$ is the maximum size of a set of edges of which every pair has distance at most two. In this talk, we …
Loading view.
Pascal Gollin, Disjoint dijoins for classes of dibonds in finite and infinite digraphs
Room B232 IBS (기초과학연구원)A dibond in a directed graph is a bond (i.e. a minimal non-empty cut) for which all of its edges are directed to a common side of the cut. A …
Casey Tompkins, Saturation problems in the Ramsey theory of graphs, posets and point sets
Room B232 IBS (기초과학연구원)In 1964, Erdős, Hajnal and Moon introduced a saturation version of Turán's classical theorem in extremal graph theory. In particular, they determined the minimum number of edges in a $K_r$-free, …
Sang-il Oum (엄상일), Survey on vertex-minors
Room B232 IBS (기초과학연구원)For a vertex v of a graph G, the local complementation at v is an operation to obtain a new graph denoted by G*v from G such that two distinct vertices x, …
Seunghun Lee (이승훈), Leray numbers of complexes of graphs with bounded matching number
Room B232 IBS (기초과학연구원)Given a graph $G$ on the vertex set $V$, the non-matching complex of $G$, $\mathsf{NM}_k(G)$, is the family of subgraphs $G' \subset G$ whose matching number $\nu(G')$ is strictly less …
Canceled
KSIAM 2020 Spring Conference (cancelled)
IBS Science Culture CenterKSIAM 2020 Spring Conference will be held at IBS from May 8, 2020 to May 9, 2020. Organized by Korean Society for Industrial and Applied Mathematics. Organizing Committee Myungjoo Kang …
Eun Jung Kim (김은정), Twin-width: tractable FO model checking
Room B232 IBS (기초과학연구원)Inspired by a width invariant defined on permutations by Guillemot and Marx , we introduce the notion of twin-width on graphs and on matrices. Proper minor-closed classes, bounded rank-width graphs, map …
O-joung Kwon (권오정), Mim-width: a width parameter beyond rank-width
Room B232 IBS (기초과학연구원)Vatshelle (2012) introduced a width parameter called mim-width. It is based on the following cut function : for a vertex partition (A,B) of a graph, the complexity of this partition …
Hong Liu (刘鸿), Asymptotic Structure for the Clique Density Theorem
Room B232 IBS (기초과학연구원)The famous Erdős-Rademacher problem asks for the smallest number of r-cliques in a graph with the given number of vertices and edges. Despite decades of active attempts, the asymptotic value …
Huy-Tung Nguyen, The average cut-rank of graphs
Room B232 IBS (기초과학연구원)The cut-rank of a set X of vertices in a graph G is defined as the rank of the X×(V(G)∖X) matrix over the binary field whose (i,j)-entry is 1 if …