Tag Archives: Shrikhande graph

Shrikhande 100

Professor S. S. Shrikhande is 100. I offer him my warmest congratulations and birthday greetings. Among much else in his distinguished career, he was one of the three who showed that a pair of orthogonal Latin squares exists for every … Continue reading

Posted in events, exposition, history | Tagged , , | Leave a comment

A Shrikhande challenge

I discussed here the problem of covering the m-fold complete graph on n vertices with copies of a given graph G. The smallest strongly regular graph for which I don’t know the answer is the Shrikhande graph. I can copy … Continue reading

Posted in open problems | Tagged | 1 Comment