Seunghun Lee (이승훈), Transversals and colorings of simplicial spheres
Room B232 IBS (기초과학연구원)Motivated from the surrounding property of a point set in
10 events found.
Discrete Math Seminar
Andreas Holmsen, Some recent results on geometric transversals
Room B232 IBS (기초과학연구원)A geometric transversal to a family of convex sets in
Jaehyeon Seo (서재현), A rainbow Turán problem for color-critical graphs
Room B232 IBS (기초과학연구원)For given
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
Pascal Gollin, A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups
Room B232 IBS (기초과학연구원)Erdős and Pósa proved in 1965 that there is a duality between the maximum size of a packing of cycles and the minimum size of a vertex set hitting all …
Jinha Kim (김진하), Independent domination of graphs with bounded maximum degree
Room B232 IBS (기초과학연구원)An independent dominating set of a graph, also known as a maximal independent set, is a set
Donggyu Kim (김동규), A stronger version of Tutte’s wheel theorem for vertex-minors
Room B232 IBS (기초과학연구원)Tutte (1961) proved that every simple
Sang-il Oum (엄상일), Obstructions for matroids of path-width at most k and graphs of linear rank-width at most k
Room B232 IBS (기초과학연구원)Every minor-closed class of matroids of bounded branch-width can be characterized by a minimal list of excluded minors, but unlike graphs, this list could be infinite in general. However, for …
Kevin Hendrey, A unified Erdős-Pósa theorem for cycles in graphs labelled by multiple abelian groups (revisited)
Room B232 IBS (기초과학연구원)This talk follows on from the recent talk of Pascal Gollin in this seminar series, but will aim to be accessible for newcomers. Erdős and Pósa proved in 1965 that …
Tuan Anh Do, Rank- and tree-width of supercritical random graphs
Room B232 IBS (기초과학연구원)It is known that the rank- and tree-width of the random graph