Euiwoong Lee (이의웅), The Karger-Stein algorithm is optimal for k-cut
In the k-cut problem, we are given an edge-weighted graph and want to find the least-weight set of edges whose deletion breaks the graph into k connected components. It is …
10 events found.
Seminars and Colloquiums
Events
-
-
Room B232 IBS (기초과학연구원)
-
Maria Chudnovsky, Induced subgraphs and tree decompositions
Zoom ID: 869 4632 6610 (ibsdimag)Tree decompositions are a powerful tool in structural graph theory; they are traditionally used in the context of forbidden graph minors. Connecting tree decompositions and forbidden induced subgraphs has until …
-
-
Duksang Lee (이덕상), Intertwining connectivities for vertex-minors and pivot-minors
Room B232 IBS (기초과학연구원)We show that for pairs (Q,R) and (S,T) of disjoint subsets of vertices of a graph G, if G is sufficiently large, then there exists a vertex v in V(G)−(Q∪R∪S∪T) such …
-
Linda Cook, Two results on graphs with holes of restricted lengths
Room B232 IBS (기초과학연구원)We call an induced cycle of length at least four a hole. The parity of a hole is the parity of its length. Forbidding holes of certain types in a graph …
-
Petr Hliněný, Twin-width is linear in the poset width
Zoom ID: 869 4632 6610 (ibsdimag)Twin-width is a new parameter informally measuring how diverse are the neighbourhoods of the graph vertices, and it extends also to other binary relational structures, e.g. to digraphs and posets. It was introduced …
-
Eun Jung Kim (김은정), A Constant-factor Approximation for Weighted Bond Cover
Room B232 IBS (기초과학연구원)The Weighted $\mathcal F$-Vertex Deletion for a class $\mathcal F$ of graphs asks, given a weighted graph $G$, for a minimum weight vertex set $S$ such that $G-S\in\mathcal F$. The …
-
Cheolwon Heo (허철원), Representations of even-cycle matroids
Room B232 IBS (기초과학연구원)A signed graph is a pair $(G,\Sigma)$ where $G$ is a graph and $\Sigma$ is a subset of edges of $G$. A cycle $C$ of $G$ is a subset of …
-
-
Dabeen Lee (이다빈), Mixing sets, submodularity, and chance-constrained optimization
Room B232 IBS (기초과학연구원)A particularly important substructure in modeling joint linear chance-constrained programs with random right-hand sides and finite sample space is the intersection of mixing sets with common binary variables (and possibly …
-
Kevin Hendrey, Extremal functions for sparse minors
Room B232 IBS (기초과학연구원)The extremal function $c(H)$ of a graph $H$ is the supremum of densities of graphs not containing $H$ as a minor, where the density of a graph is the ratio …
-
Péter Pál Pach, The Alon-Jaeger-Tarsi conjecture via group ring identities
Zoom ID: 869 4632 6610 (ibsdimag)The Alon-Jaeger-Tarsi conjecture states that for any finite field $\mathbb{F}$ of size at least 4 and any nonsingular matrix $M$ over $\mathbb{F}$ there exists a vector $x$ such that neither …