Tony Huynh, The Peaceable Queens Problem
Room B332 IBS (기초과학연구원)The peaceable queens problem asks to determine the maximum number $a(n)$ such that there is a placement of $a(n)$ white queens and $a(n)$ black queens on an $n \times n$ …
Loading view.
Discrete Math Seminar
Laure Morelle, Bounded size modifications in time $2^{{\sf poly}(k)}\cdot n^2$
Room B332 IBS (기초과학연구원)A replacement action is a function $\mathcal L$ that maps each graph to a collection of subgraphs of smaller size. Given a graph class $\mathcal H$, we consider a general …
Jang Soo Kim (김장수), Longest elements in a semigroup of functions and Slater indices
Room B332 IBS (기초과학연구원)The group \( S_n \) of permutations on \(=\{1,2,\dots,n\} \) is generated by simple transpositions \( s_i = (i,i+1) \). The length \( \ell(\pi) \) of a permutation \( \pi …
Jungho Ahn (안정호), A coarse Erdős-Pósa theorem for constrained cycles
Room B332 IBS (기초과학연구원)An induced packing of cycles in a graph is a set of vertex-disjoint cycles such that the graph has no edge between distinct cycles of the set. The classic Erdős-Pósa theorem …