Ben Lund, Maximal 3-wise intersecting families
Room B232 IBS (기초과학연구원)A family
10 events found.
Discrete Math Seminar
Jaehoon Kim (김재훈), 2-complexes with unique embeddings in 3-space
Room B232 IBS (기초과학연구원)A well-known theorem of Whitney states that a 3-connected planar graph admits an essentially unique embedding into the 2-sphere. We prove a 3-dimensional analogue: a simply-connected 2-complex every link graph …
Casey Tompkins, Ramsey numbers of Boolean lattices
Room B232 IBS (기초과학연구원)The poset Ramsey number
Seonghyuk Im (임성혁), Large clique subdivisions in graphs without small dense subgraphs
Room B232 IBS (기초과학연구원)What is the largest number
Eun-Kyung Cho (조은경), Independent domination of graphs with bounded maximum degree
Room B232 IBS (기초과학연구원)The independent domination number of a graph
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, …
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
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