Bjarne Schülke, A local version of Katona’s intersection theorem
Room B332 IBS (기초과학연구원)Katona's intersection theorem states that every intersecting family
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
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 …
Let
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 …
A linear
The disjoint paths logic, FOL+DP, is an extension of First Order Logic (FOL) with the extra atomic predicate