Home » News » seminar » Daniel Cranston gave a talk on partitioning the vertex set of a graph into an edge-less graph and a forest consisting of small components at the Virtual Discrete Math Colloquium

Daniel Cranston gave a talk on partitioning the vertex set of a graph into an edge-less graph and a forest consisting of small components at the Virtual Discrete Math Colloquium

On November 5, 2020, Daniel Cranston from Virginia Commonwealth University gave a talk on the condition of the maximum average degree for a graph to have a partition of its vertex set into an independent set and a set inducing a forest consisting of components of small size at the Virtual Discrete Math Colloquium. The title of his talk was “Vertex Partitions into an Independent Set and a Forest with Each Component Small“.