4 papers
Infinite Gammoids: Minors and Duality
Seyed Hadi Afzali Borujeni, Hiu Fai Law, Malte Müller
This sequel to our paper (Infinite gammoids, 2014) considers minors and duals of infinite gammoids. We prove that a class of gammoids definable by digraphs not containing a certain…
On the number of -matchings in a Tree
Dong Yeap Kang, Jaehoon Kim, Younjin Kim +1
An -matching in a graph is a collection of edges in such that the distance between any two edges is at least . A -matching is also called an induced matching. In t…
Infinite strict gammoids
Hadi Afzali, Hiu-Fai Law, Malte Müller
Finite strict gammoids, introduced in the early 1970's, are matroids defined via finite digraphs equipped with some set of sinks: a set of vertices is independent if it admits a li…
Independent sets in graphs with given minimum degree
Hiu-Fai Law, Colin McDiarmid
We consider numbers and sizes of independent sets in graphs with minimum degree at least , when the number of vertices is large. In particular we investigate which of these…