Reshma Ramadurai

collaborators

2 papers

math.CO2017

Counterexamples on matchings in hypergraphs and full rainbow matchings in graphs

Pu Gao, Reshma Ramadurai, Ian M. Wanless +1

A graph $G$ whose edges are coloured (not necessarily properly) contains a full rainbow matching if there is a matching $M$ that contains exactly one edge of each colour. We refute…

math.CO2016

On the distances between Latin squares and the smallest defining set size

Nicholas Cavenagh, Reshma Ramadurai

In this note we show that for each Latin square $L$ of order $n \geq 2$ , there exists a Latin square $L^{'} \neq = L$ of order $n$ such that $L$ and $L^{'}$ differ in at most $8 n$ cel…