Timeline for Regular graphs with strongly regular edge colorings
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 26, 2015 at 11:12 | vote | accept | Penguian | ||
| Oct 11, 2016 at 21:57 | |||||
| Apr 26, 2015 at 11:11 | vote | accept | Penguian | ||
| Apr 26, 2015 at 11:12 | |||||
| Apr 14, 2015 at 6:12 | comment | added | Penguian | I have now written up the proof. | |
| Mar 31, 2015 at 4:00 | comment | added | Penguian | In the case of Question 2 of my Banff questions, I can now prove that the graphs given by the red and the blue edges are not isomorphic when m > 3. The proof uses Radon-Hurwitz theory to show that the maximum clique sizes of the two graphs differ. I will speak about this at the University of Newcastle and then write it up. | |
| Jan 2, 2015 at 10:44 | comment | added | Penguian | I have posted the Python source code for the search on Github in the Hadamard-fractious repository. I have also posted Cython code that is equivalent, but about 4 times faster. | |
| Nov 8, 2014 at 21:36 | comment | added | Penguian | In the case of Question 2 of my Banff questions, I have now running a backtracking tree search to look for an automorphism of $\Delta_m$ that swaps the colours of the red and blue edges. I wrote the search in less than 100 lines of plain Python code, and it does not depend on graph libraries (e.g. Gephi, iGraph, NetworkX). The search finds the known automorphisms for $m=1,2,3,$ but fails to find one for $m=4.$ | |
| Nov 8, 2014 at 21:13 | vote | accept | Penguian | ||
| Nov 8, 2014 at 21:25 | |||||
| Oct 2, 2014 at 2:53 | history | answered | Padraig Ó Catháin | CC BY-SA 3.0 |