Search
In order to further develop the theory of packing trees and packing forests in an undirected graph, we extended the notion of supermodular functions
A triangulation of a surface is k-irreducible if every edge belongs to a non-contractible curve of length k and there are no shorter non-contractible
A landmark result of Alon and Shapira characterises testable graph properties by showing that every such property can be described via the Szemerédi
We will look at an analogue theorem of the classical Erdős-Pósa Theorem. We prove a $GF(q)$-representable matroid analogue of Robertson and Seymour's
A temporal graph G is a sequence of graphs G1, G2, ... , Gt on the same vertex set. In this talk, we are interested in the analogue of the Travelling