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 …
10 events found.
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, 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 …
Amadeus Reinald, Oriented trees in
Room B332
IBS (기초과학연구원)
In 1980, Burr conjectured that every directed graph with chromatic number
Neal Bushaw, Edge-colored Extremal Problems
Room B332 IBS (기초과학연구원)An edge-colored graph
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
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 …
Mathias Schacht, Canonical colourings in random graphs
Room B332 IBS (기초과학연구원)Rödl and Ruciński established Ramsey's theorem for random graphs. In particular, for fixed integers
Kyeongsik Nam (남경식), Random walks on percolation
Room B332 IBS (기초과학연구원)In general, random walks on fractal graphs are expected to exhibit anomalous behaviors, for example heat kernel is significantly different from that in the case of lattices. Alexander and Orbach …