Jozef Skokan, Separating the edges of a graph by a linear number of paths
Room B332 IBS (기초과학연구원)Recently, Letzter proved that any graph of order n contains a collection P of
10 events found.
Seminars and Colloquiums
Maria Chudnovsky, Induced subgraphs and tree decompositions
Room 1501, Bldg. E6-1, KAISTTree decompositions are a powerful tool in both structural graph theory and graph algorithms. Many hard problems become tractable if the input graph is known to have a tree decomposition of bounded “width”. Exhibiting a particular kind of a tree decomposition is also a useful way to describe the structure of a graph. Tree decompositions …
Oliver Janzer, Small subgraphs with large average degree
Room B332 IBS (기초과학연구원)We study the fundamental problem of finding small dense subgraphs in a given graph. For a real number
Szymon Toruńczyk, Flip-width: Cops and Robber on dense graphs
Zoom ID: 869 4632 6610 (ibsdimag)We define new graph parameters, called flip-width, that generalize treewidth, degeneracy, and generalized coloring numbers for sparse graphs, and clique-width and twin-width for dense graphs. The flip-width parameters are defined using variants of the Cops and Robber game, in which the robber has speed bounded by a fixed constant r∈N∪{∞}, and the cops perform flips …
Suyun Jiang (江素云), How connectivity affects the extremal number of trees
Room B332 IBS (기초과학연구원)The Erdős-Sós conjecture states that the maximum number of edges in an
Minho Cho (조민호), Strong Erdős-Hajnal property on chordal graphs and its variants
Room B332 IBS (기초과학연구원)A graph class
Guanghui Wang (王光辉), Embeddings in uniformly dense hypergraphs
Room B332 IBS (기초과학연구원)An archetype problem in extremal combinatorics is to study the structure of subgraphs appearing in different classes of (hyper)graphs. We will focus on such embedding problems in uniformly dense hypergraphs. In precise, we will mention the uniform Turan density of some hypergraphs.
Chong Shangguan (上官冲), The hat guessing number of graphs
Room B332 IBS (기초과학연구원)Consider the following hat guessing game:
Tuan Tran, Complexity of null dynamical systems
Room B109 IBS (기초과학연구원)A theoretical dynamical system is a pair (X,T) where X is a compact metric space and T is a self homeomorphism of X. The topological entropy of a theoretical dynamical system (X,T), first introduced in 1965 by Adler, Konheim and McAndrew, is a nonnegative real number that measures the complexity of the system. Systems with positive …
Xuding Zhu (朱緒鼎), List version of 1-2-3 conjecture
Room B109 IBS (기초과학연구원)The well-known 1-2-3 Conjecture by Karoński, Łuczak and Thomason states that the edges of any connected graph with at least three vertices can be assigned weights 1, 2 or 3 so that for each edge