Euiwoong Lee (이의웅), Parameterized Approximability of F-Deletion Problems
Room B332 IBS (기초과학연구원)For a family F of graphs, the F-Deletion Problem asks to remove the minimum number of vertices from a given graph G to ensure that G belongs to F. One …
Loading view.
Discrete Math Seminar
Daniel Král’, Matroid depth and width parameters
Room B332 IBS (기초과학연구원)Depth and width parameters of graphs, e.g., tree-width, path-width and tree-depth, play a crucial role in algorithmic and structural graph theory. These notions are of fundamental importance in the theory …
Peter Nelson, Formalizing matroid theory in a proof assistant
Room B332 IBS (기초과학연구원)For the past few years, I've been working on formalizing proofs in matroid theory using the Lean proof assistant. This has led me to many interesting and unexpected places. I'll …
Dillon Mayhew, Towards Rota’s conjecture for gain-graphic matroids
Room B332 IBS (기초과학연구원)In some sense, matroids are generalisations of graphs. The idea of graph minors extends to matroids, and so does the idea of a minor-closed class. We can think of a …
Amadeus Reinald, Oriented trees in $O(k \sqrt{k})$-chromatic digraphs, a subquadratic bound for Burr’s conjecture
Room B332 IBS (기초과학연구원)In 1980, Burr conjectured that every directed graph with chromatic number $2k-2$ contains any oriented tree of order $k$ as a subdigraph. Burr showed that chromatic number $(k-1)^2$ suffices, which …
Neal Bushaw, Edge-colored Extremal Problems
Room B332 IBS (기초과학연구원)An edge-colored graph $H$ is called rainbow if all of its edges are given distinct colors. An edge-colored graph $G$ is then called rainbow $H$-free when no copy of $H$ in …