R. Amzi Jeffs, Intersection patterns of convex sets
How can one arrange a collection of convex sets in d-dimensional Euclidean space? This guiding question is fundamental in discrete geometry, and can be made concrete in a variety of …
10 events found.
Discrete Math Seminar
Events
-
-
Room B332 IBS (기초과학연구원)
-
Linda Cook, Orientations of $P_4$ bind the dichromatic number
Room B332 IBS (기초과학연구원)An oriented graph is a digraph that does not contain a directed cycle of length two. An (oriented) graph $D$ is $H$-free if $D$ does not contain $H$ as an …
-
Dabeen Lee (이다빈), From coordinate subspaces over finite fields to ideal multipartite uniform clutters
Room B332 IBS (기초과학연구원)Take a prime power $q$, an integer $n\geq 2$, and a coordinate subspace $S\subseteq GF(q)^n$ over the Galois field $GF(q)$. One can associate with $S$ an $n$-partite $n$-uniform clutter $\mathcal{C}$, …
-
-
Sebastian Wiederrecht, Delineating half-integrality of the Erdős-Pósa property for minors
Room B332 IBS (기초과학연구원)In 1986, Robertson and Seymour proved a generalization of the seminal result of Erdős and Pósa on the duality of packing and covering cycles: A graph has the Erdős-Pósa property …
-
Seog-Jin Kim (김석진), The square of every subcubic planar graph of girth at least 6 is 7-choosable
Room B332 IBS (기초과학연구원)The square of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is …
-
Donggyu Kim (김동규), Orthogonal matroids over tracts
Room B332 IBS (기초과학연구원)Even delta-matroids generalize matroids, as they are defined by a certain basis exchange axiom weaker than that of matroids. One natural example of even delta-matroids comes from a skew-symmetric matrix …
-
Carl R. Yerger, Solving Problems in Graph Pebbling using Optimization and Structural Techniques
Room B332 IBS (기초과학연구원)Graph pebbling is a combinatorial game played on an undirected graph with an initial configuration of pebbles. A pebbling move consists of removing two pebbles from one vertex and placing …
-
-
Domagoj Bradač, Effective bounds for induced size-Ramsey numbers of cycles
Room B332 IBS (기초과학연구원)The k-color induced size-Ramsey number of a graph H is the smallest number of edges a (host) graph G can have such that for any k-coloring of its edges, there …
-
Matija Bucić, Essentially tight bounds for rainbow cycles in proper edge-colourings
Room B332 IBS (기초과학연구원)An edge-coloured graph is said to be rainbow if it uses no colour more than once. Extremal problems involving rainbow objects have been a focus of much research over the …
-
Robert Hickingbotham, Powers of planar graphs, product structure, and blocking partitions
Room B332 IBS (기초과학연구원)Graph product structure theory describes complex graphs in terms of products of simpler graphs. In this talk, I will introduce this subject and talk about some of my recent results …