Julien Codsi, Recent progress in the tree-⍺ world
Treewidth is a graph parameter commonly used to quantify how "close" a graph is to a tree. Although it is a cornerstone of structural graph theory and algorithm design, it …
5 events found.
Events
-
-
Room B332 IBS (기초과학연구원)
-
2026 Combinatorics Workshop (2026 조합론 학술대회)
Konjiam Resort, EW Village, B2, Meeting Room OPUS2Combinatorics Workshop (조합론 학술대회) is an annual conference for researchers in combinatorics and related areas in Korea. It was started in 2004 by the Yonsei University BK21 Research Group. Since …
-
Xiying Du, Characterizing (2,3)-linked graphs
Room B332 IBS (기초과학연구원)We say a graph $G$ is $(2,m)$-linked if, for every choice of $m+2$ distinct vertices $a_1,\ldots,a_m,b_1,b_2$ in $G$, there exist two vertex-disjoint connected subgraphs $A$ and $B$ of $G$ such …
-
-
Joonkyung Lee (이준경), TBA
Room B332 IBS (기초과학연구원)TBA
-
-
William J. Wesley, An elementary solution to the 2-color Pythagorean triples problem
Room B332 IBS (기초과학연구원)In the 1980s, Ron Graham asked whether every red/blue coloring of the positive integers contains a monochromatic Pythagorean triple and offered a $100 prize for the answer. The bounty was …