Reshma Ramadurai

most citedFull rainbow matchings in graphs and hypergraphs

7 citations · 7 across the 2 of their papers we have counts for

collaborators

4 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.CO2017★ 7 cited

Full rainbow matchings in graphs and hypergraphs

Pu Gao, Reshma Ramadurai, Ian Wanless +1

Let $G$ be a simple graph that is properly edge coloured with $m$ colours and let $\M=\{M_1,\ldots, M_m\}$ be the set of $m$ matchings induced by the colours in $G$ . Suppose that $…

math.CO2016

A threshold result for loose Hamiltonicity in random regular uniform hypergraphs

Daniel Altman, Catherine Greenhill, Mikhail Isaev +1

Let $G (n, r, s)$ denote a uniformly random $r$ -regular $s$ -uniform hypergraph on $n$ vertices, where $s$ is a fixed constant and $r = r (n)$ may grow with $n$ . An $ℓ$ -overl…

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…