Eun Jung Kim (김은정), Directed flow-augmentation
Room B332 IBS (기초과학연구원)We show a flow-augmentation algorithm in directed graphs: There exists a polynomial-time algorithm that, given a directed graph G, two integers
10 events found.
Discrete Math Seminar
Noleen Köhler, Testing first-order definable properties on bounded degree graphs
Room B332 IBS (기초과학연구원)Property testers are probabilistic algorithms aiming to solve a decision problem efficiently in the context of big-data. A property tester for a property P has to decide (with high probability …
Raul Lopes, Temporal Menger and related problems
Room B332 IBS (기초과학연구원)A temporal graph is a graph whose edges are available only at specific times. In this scenario, the only valid walks are the ones traversing adjacent edges respecting their availability, …
Jun Gao, Number of (k-1)-cliques in k-critical graph
Room B332 IBS (기초과학연구원)We prove that for
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 …