Seunghun Lee (이승훈), Inscribable order types
Room B332 IBS (기초과학연구원)We call an order type inscribable if it is realized by a point configuration where all extreme points are all on a circle. In this talk, we investigate inscribability of …
We call an order type inscribable if it is realized by a point configuration where all extreme points are all on a circle. In this talk, we investigate inscribability of …
We show a flow-augmentation algorithm in directed graphs: There exists a polynomial-time algorithm that, given a directed graph G, two integers
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 …
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, …
We prove that for
Katona's intersection theorem states that every intersecting family
The Structural Theorem of the Graph Minors series of Robertson and Seymour asserts that, for every
Van der Waerden's theorem states that any coloring of
For a graph
We determine the maximum number of copies of