Sebastian Wiederrecht, Packing even directed circuits quarter-integrally
Room B332 IBS (기초과학연구원)We prove the existence of a computable function
We prove the existence of a computable function
There has been a raising interest on the study of perfect matchings in uniform hypergraphs in the past two decades, including extremal problems and their algorithmic versions. I will introduce …
Amazon drivers hit the road every day, each taking a Prime van in a traveling salesman problem tour through 150 or more customer stops. But even a whisper of the …
We prove a conjecture of Bonamy, Bousquet, Pilipczuk, Rzążewski, Thomassé, and Walczak, that for every graph
Let
Bollobás proved that for every
The positive discrepancy of a graph
Delta-matroids are a generalization of matroids with connections to many parts of graph theory and combinatorics (such as matching theory and the structure of topological graph embeddings). Formally, a delta-matroid …
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 …
A family