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 …
10 events found.
Seminars and Colloquiums
-
-
-
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 …
-
-
Eunjin Oh (오은진), Feedback Vertex Set on Geometric Intersection Graphs
Room B232 IBS (기초과학연구원)I am going to present an algorithm for computing a feedback vertex set of a unit disk graph of size k, if it exists, which runs in time $2^{O(\sqrt{k})}(n + …
-
Paul Seymour, Polynomial bounds for chromatic number
Zoom ID: 869 4632 6610 (ibsdimag)The Gyárfás-Sumner conjecture says that for every forest $H$, there is a function $f$ such that the chromatic number $\chi(G)$ is at most $f(\omega(G))$ for every $H$-free graph $G$ ("$H$-free" means with …
-
Joonkyung Lee (이준경), Majority dynamics on sparse random graphs
Room B232 IBS (기초과학연구원)Majority dynamics on a graph $G$ is a deterministic process such that every vertex updates its $\pm 1$-assignment according to the majority assignment on its neighbor simultaneously at each step. …