Maria Chudnovsky, Induced subgraphs and tree decompositions
Tree 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 …
10 events found.
Seminars and Colloquiums
Events
-
-
Room 1501, Bldg. E6-1, KAIST
-
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 $s>2$, we prove that every graph on $n$ vertices with average degree …
-
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 …
-
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 $n$-vertex graph without a given $k$-vertex tree is at most $\frac {n(k-2)}{2}$. Despite significant interest, the conjecture remains …
-
-
Minho Cho (조민호), Strong Erdős-Hajnal property on chordal graphs and its variants
Room B332 IBS (기초과학연구원)A graph class $\mathcal{G}$ has the strong Erdős-Hajnal property (SEH-property) if there is a constant $c=c(\mathcal{G}) > 0$ such that for every member $G$ of $\mathcal{G}$, either $G$ or its …
-
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. …
-
Chong Shangguan (上官冲), The hat guessing number of graphs
Room B332 IBS (기초과학연구원)Consider the following hat guessing game: $n$ players are placed on $n$ vertices of a graph, each wearing a hat whose color is arbitrarily chosen from a set of $q$ …
-
-
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 …
-
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 …
-
Andrzej Grzesik, Rainbow Turán problems
Room S221 IBS (기초과학연구원) Science Culture CenterIn a rainbow variant of the Turán problem, we consider $k$ graphs on the same set of vertices and want to determine the smallest possible number of edges in each …