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.
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 …
2024 Workshop on (Mostly) Matroids
IBS Science Culture CenterThe 2024 Workshop on (Mostly) Matroids will be held in-person at the Institute for Basic Science (IBS), Daejeon, South Korea, from August 19, 2024 to August 23, 2024. We expect …
Dillon Mayhew, Monadic second-order definability for gain-graphic matroids
Room B332 IBS (기초과학연구원)Every (finite) matroid consists of a (finite) set called the ground set, and a collection of distinguished subsets called the independent sets. A classic example arises when the ground set …
2024 Combinatorics Workshop (2024 조합론 학술대회)
Chungbuk National UniversityWebsite: https://cw2024.combinatorics.kr/ Location Chungbuk National University, Cheongju, Korea. Advisory Committee Committee of Discrete Mathematics, The Korean Mathematical Society (Chair: Sang-il Oum, IBS Discrete Mathematics Group / KAIST) Sponsors IBS Discrete …
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 …
Zhihan Jin (金之涵), The Helly number of Hamming balls and related problems
Room B332 IBS (기초과학연구원)We prove the following variant of Helly’s classical theorem for Hamming balls with a bounded radius. For $n > t$ and any (finite or infinite) set $X$, if in a …
Gábor Tardos, Extremal theory of 0-1 matrices
Room B332 IBS (기초과학연구원)We say that a 0-1 matrix A contains another such matrix (pattern) P if P can be obtained from a submatrix of A by possibly changing a few 1 entries …