Víctor Dalmau, Right-adjoints of Datalog Programs
Room B332 IBS (기초과학연구원)We say that two functors Λ and Γ between thin categories of relational structures are adjoint if for all structures A and B, we have that Λ(A) maps homomorphically to …
Loading view.
Seminars and Colloquiums
Maximilian Gorsky, Towards the half-integral Erdős-Pósa property for even dicycles
Room B332 IBS (기초과학연구원)A family $\mathcal F$ of (di)graphs is said to have the half- or quarter-integral Erdős-Pósa property if, for any integer $k$ and any (di)graph $G$, there either exist $k$ copies …
Tony Huynh, Aharoni’s rainbow cycle conjecture holds up to an additive constant
Room B332 IBS (기초과학연구원)In 2017, Aharoni proposed the following generalization of the Caccetta-Häggkvist conjecture for digraphs. If G is a simple n-vertex edge-colored graph with n color classes of size at least r, …
Niloufar Fuladi, Cross-cap drawings and signed reversal distance
Room B332 IBS (기초과학연구원)A cross-cap drawing of a graph G is a drawing on the sphere with g distinct points, called cross-caps, such that the drawing is an embedding except at the cross-caps, …
Vadim Lozin, Graph problems and monotone classes
Room B332 IBS (기초과학연구원)Very little is known about critical properties of graphs in the hierarchy of monotone classes, i.e. classes closed under taking (not necessarily induced) subgraphs. We distinguish four important levels in …
Yongho Shin (신용호), Three-way online correlated selection
Room B332 IBS (기초과학연구원)Two-way online correlated selection (two-way OCS) is an online algorithm that, at each timestep, takes a pair of elements from the ground set and irrevocably chooses one of the two …
Jane Tan, Semi-strong colourings of hypergraphs
Room B332 IBS (기초과학연구원)A vertex colouring of a hypergraph is $c$-strong if every edge $e$ sees at least $\min\{c, |e|\}$ distinct colours. Let $\chi(t,c)$ denote the least number of colours needed so that …
Maria Chudnovsky, Anticomplete subgraphs of large treewidth
Room B332 IBS (기초과학연구원)We will discuss recent progress on the topic of induced subgraphs and tree-decompositions. In particular this talk with focus on the proof of a conjecture of Hajebi that asserts that …
Semin Yoo (유세민), Paley-like quasi-random graphs arising from polynomials
Room B332 IBS (기초과학연구원)We provide new constructions of families of quasi-random graphs that behave like Paley graphs but are neither Cayley graphs nor Cayley sum graphs. These graphs give a unified perspective of …
Wonwoo Kang (강원우), Skein relations for punctured surfaces
Room B332 IBS (기초과학연구원)Since the introduction of cluster algebras by Fomin and Zelevinsky in 2002, there has been significant interest in cluster algebras of surface type. These algebras are particularly noteworthy due to …