Linda Cook, Orientations of 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
An oriented graph is a digraph that does not contain a directed cycle of length two. An (oriented) graph
Take a prime power
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 …
The square of a graph
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 …
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 …
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 …
This workshop aims to foster collaborative discussions and explore the various aspects of vertex-minors, including structural theory and their applications. This event will be small-scale, allowing for focused talks and …
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 …
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 …