Casey Tompkins, Ramsey numbers of Boolean lattices
Room B232 IBS (기초과학연구원)The poset Ramsey number
10 events found.
Seminars and Colloquiums
Tuukka Korhonen, Fast FPT-Approximation of Branchwidth
Zoom ID: 869 4632 6610 (ibsdimag)Branchwidth determines how graphs, and more generally, arbitrary connectivity (basically symmetric and submodular) functions could be decomposed into a tree-like structure by specific cuts. We develop a general framework for designing fixed-parameter tractable (FPT) 2-approximation algorithms for branchwidth of connectivity functions. The first ingredient of our framework is combinatorial. We prove a structural theorem establishing …
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
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 as to solve asymptotically some well known conjectures. This is joint work with Alexey Pokrovskiy and Benny Sudakov.
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, and (iii) certain random variable on the boundary of a ball has a small tail. As applications, we show that the volume of intersection of …
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