Michał Seweryn, Dimension and standard examples in planar posets
Room B332 IBS (기초과학연구원)The dimension of a poset is the least integer
10 events found.
Discrete Math Seminar
Hyunwoo Lee (이현우), Reconstructing hypergraph matching polynomials
Room B332 IBS (기초과학연구원)By utilizing the recently developed hypergraph analogue of Godsil's identity by the second author, we prove that for all
Marcelo Garlet Milani, Cycles of Well-Linked Sets and an Elementary Bound for the Directed Grid Theorem
Room B332 IBS (기초과학연구원)In 2015, Kawarabayashi and Kreutzer proved the directed grid theorem. The theorem states the existence of a function f such that every digraph of directed tree-width f(k) contains a cylindrical …
Daniel McGinnis, A necessary and sufficient condition for
Room B332
IBS (기초과학연구원)
We solve a long-standing open problem posed by Goodman and Pollack in 1988 by establishing a necessary and sufficient condition for a finite family of convex sets in
Nicola Lorenz, A Minor Characterisation of Normally Spanned Sets of Vertices
Room B332 IBS (기초과학연구원)A rooted spanning tree of a graph
Marcin Briański, TBA
Room B332 IBS (기초과학연구원)Eunjin Oh (오은진), Approximation Algorithms for the Geometric Multimatching Problem
Room B332 IBS (기초과학연구원)Let S and T be two sets of points in a metric space with a total of n points. Each point in S and T has an associated value that specifies an upper limit on how many points it can …
Seokbeom Kim (김석범), The structure of △(1, 2, 2)-free tournaments
Room B332 IBS (기초과학연구원)Given a tournament
Denys Bulavka, TBA
Room B332 IBS (기초과학연구원)On-Hei Solomon Lo, Minors of non-hamiltonian graphs
Room B332 IBS (기초과학연구원)A seminal result of Tutte asserts that every 4-connected planar graph is hamiltonian. By Wagner's theorem, Tutte's result can be restated as: every 4-connected graph with no