Casey Tompkins, Ramsey numbers of Boolean lattices
The poset Ramsey number $R(Q_{m},Q_{n})$ is the smallest integer $N$ such that any blue-red coloring of the elements of the Boolean lattice $Q_{N}$ has a blue induced copy of $Q_{m}$ …
10 events found.
Discrete Math Seminar
Events
-
-
Room B232 IBS (기초과학연구원)
-
Seonghyuk Im (임성혁), Large clique subdivisions in graphs without small dense subgraphs
Room B232 IBS (기초과학연구원)What is the largest number $f(d)$ where every graph with average degree at least $d$ contains a subdivision of $K_{f(d)}$? Mader asked this question in 1967 and $f(d) = \Theta(\sqrt{d})$ …
-
-
Eun-Kyung Cho (조은경), Independent domination of graphs with bounded maximum degree
Room B232 IBS (기초과학연구원)The independent domination number of a graph $G$, denoted $i(G)$, is the minimum size of an independent dominating set of $G$. In this talk, we prove a series of results regarding …
-
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 $\mathbb{R}^d$ introduced by Holmsen, Pach and Tverberg, we consider the transversal number and chromatic number of a simplicial sphere. As …
-
Andreas Holmsen, Some recent results on geometric transversals
Room B232 IBS (기초과학연구원)A geometric transversal to a family of convex sets in $\mathbb R^d$ is an affine flat that intersects the members of the family. While there exists a far-reaching theory concerning …
-
Jaehyeon Seo (서재현), A rainbow Turán problem for color-critical graphs
Room B232 IBS (기초과학연구원)For given $k$ graphs $G_1,\dots, G_k$ over a common vertex set of size $n$, what conditions on $G_i$ ensures a 'colorful' copy of $H$, i.e. a copy of $H$ containing …
-
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 $u$ and $v$, each edge incident to exactly …
-
-
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 $S$ of pairwise non-adjacent vertices such that every vertex not in $S$ is …