Reshma Ramadurai

Orcid: 0000-0003-4203-4340

According to our database1, Reshma Ramadurai authored at least 10 papers between 2007 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Full rainbow matchings in graphs and hypergraphs.
Comb. Probab. Comput., 2021

2020
A threshold result for loose Hamiltonicity in random regular uniform hypergraphs.
J. Comb. Theory, Ser. B, 2020

2016
On the distances between Latin squares and the smallest defining set size.
Electron. Notes Discret. Math., 2016

2012
On induced Folkman numbers.
Random Struct. Algorithms, 2012

Some remarks on vertex Folkman numbers for hypergraphs.
Discret. Math., 2012

When Trees Grow Low: Shrubs and Fast MSO1.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Vertex colorings of graphs without short odd cycles.
J. Graph Theory, 2011

2009
Set systems with union and intersection constraints.
J. Comb. Theory, Ser. B, 2009

Simplex Stability.
Comb. Probab. Comput., 2009

2007
Symmetric Designs and Self-Dual Codes over Rings.
Ars Comb., 2007


  Loading...