5 citations · 11 across the 7 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017
Powerful sets: a generalisation of binary matroids
Graham E. Farr, Andrew Y. Z. Wang
A set of binary vectors, with positions indexed by , is said to be a \textit{powerful code} if, for all , the number of vectors in that a…
cs.DM2017
Topological containment of the 5-clique minus an edge in 4-connected graphs
Rebecca Robinson, Graham Farr
The topological containment problem is known to be polynomial-time solvable for any fixed pattern graph , but good characterisations have been found for only a handful of non-tr…
math.CO2017
The Sprague-Grundy function for some nearly disjunctive sums of Nim and Silver Dollar games
Graham Farr, Nhan Bao Ho
We introduce and analyse an extension of the disjunctive sum operation on some classical impartial games. Whereas the disjunctive sum describes positions formed from independent su…