Eun-Kyung Cho (조은경), Independent domination of graphs with bounded maximum degree
Room B232 IBS (기초과학연구원)The independent domination number of a graph
10 events found.
David Munhá Correia, Rainbow matchings
Zoom ID: 869 4632 6610 (ibsdimag)I will discuss various results for rainbow matching problems. In particular, I will introduce a ‘sampling trick’ which can be used to obtain short proofs of old results as well …
Tuan Tran, Exponential decay of intersection volume with applications on list-decodability and sphere-covering bounds
Room B232 IBS (기초과학연구원)We give some natural sufficient conditions for balls in a metric space to have small intersection. Roughly speaking, this happens when the metric space is (i) expanding and (ii) well-spread, …
2021 Combinatorics Workshop (2021 조합론 학술대회)
The BloomvistaThe Combinatorics Workshop (조합론 학술대회) is an annual conference of combinatorialists in Korea that started in 2004 by the Yonsei University BK21 Research Group. Since 2013, this workshop has been …
Seunghun Lee (이승훈), Transversals and colorings of simplicial spheres
Room B232 IBS (기초과학연구원)Motivated from the surrounding property of a point set in
Andreas Holmsen, Some recent results on geometric transversals
Room B232 IBS (기초과학연구원)A geometric transversal to a family of convex sets in
Ron Aharoni, A strong version of the Caccetta-Haggkvist conjecture
Zoom ID: 869 4632 6610 (ibsdimag)The Caccetta-Haggkvist conjecture, one of the best known in graph theory, is that in a digraph with
Jaehyeon Seo (서재현), A rainbow Turán problem for color-critical graphs
Room B232 IBS (기초과학연구원)For given
Ken-ichi Kawarabayashi (河原林 健一), Toward Directed Graph Minor Theory
Zoom ID: 869 4632 6610 (ibsdimag)Graph Minor project by Robertson and Seymour is perhaps the deepest theory in Graph Theory. It gives a deep structural characterization of graphs without any graph
O-joung Kwon (권오정), Reduced bandwidth: a qualitative strengthening of twin-width in minor-closed classes (and beyond)
Room B232 IBS (기초과학연구원)In a reduction sequence of a graph, vertices are successively identified until the graph has one vertex. At each step, when identifying