Jun Gao, Number of (k-1)-cliques in k-critical graph
Room B332 IBS (기초과학연구원)We prove that for
10 events found.
Discrete Math Seminar
Bjarne Schülke, A local version of Katona’s intersection theorem
Room B332 IBS (기초과학연구원)Katona's intersection theorem states that every intersecting family
Sebastian Wiederrecht, Killing a vortex
Room B332 IBS (기초과학연구원)The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every
Alexander Clifton, Ramsey Theory for Diffsequences
Room B332 IBS (기초과학연구원)Van der Waerden's theorem states that any coloring of
Zixiang Xu (徐子翔), On the degenerate Turán problems
Room B332 IBS (기초과학연구원)For a graph
Nika Salia, Exact results for generalized extremal problems forbidding an even cycle
Room B332 IBS (기초과학연구원)We determine the maximum number of copies of
Florent Koechlin, Uniform random expressions lack expressivity
Room B332 IBS (기초과학연구원)In computer science, random expressions are commonly used to analyze algorithms, either to study their average complexity, or to generate benchmarks to test them experimentally. In general, these approaches only …
Jungho Ahn (안정호), Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
Room B332 IBS (기초과학연구원)Let
Sebastian Wiederrecht, Excluding single-crossing matching minors in bipartite graphs
Room B332 IBS (기초과학연구원)By a seminal result of Valiant, computing the permanent of (0, 1)-matrices is, in general, #P-hard. In 1913 Pólya asked for which (0, 1)-matrices A it is possible to change …
Seonghyuk Im (임성혁), A proof of the Elliott-Rödl conjecture on hypertrees in Steiner triple systems
Room B332 IBS (기초과학연구원)A linear