-
Seunghun Lee (이승훈), Leray numbers of complexes of graphs with bounded matching number
Seunghun Lee (이승훈), Leray numbers of complexes of graphs with bounded matching number
Given a graph
42 events found.
Calendar of Events
S Sun
M Mon
T Tue
W Wed
T Thu
F Fri
S Sat
0 events,
0 events,
1 event,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
Canceled
KSIAM 2020 Spring Conference (cancelled)
KSIAM 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 (Seoul National University) (chair) Ahn, Jaemyung (KAIST) Kwon, Hee-Dae (Inha University) Lee, Eun Jung (Yonsei University) Jang, Bongsoo (UNIST) Jung, Miyoun (Hankuk University of Foreign …
0 events,
0 events,
1 event,
-
Eun Jung Kim (김은정), Twin-width: tractable FO model checking
Eun Jung Kim (김은정), Twin-width: tractable FO model checking
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 graphs,
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
O-joung Kwon (권오정), Mim-width: a width parameter beyond rank-width
O-joung Kwon (권오정), Mim-width: a width parameter beyond rank-width
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 is computed by the size of a maximum induced matching of the bipartite subgraph induced by edges between A and B. This parameter naturally extends …
0 events,
0 events,
0 events,
0 events,
0 events,
0 events,
1 event,
-
Hong Liu (刘鸿), Asymptotic Structure for the Clique Density Theorem
Hong Liu (刘鸿), Asymptotic Structure for the Clique Density Theorem
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 of this extremal function for all r was determined only recently, by Reiher . Here we describe the asymptotic structure of all almost extremal graphs. …