Timeline for Connections between loops (algebraic structure) and graphs
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2015 at 13:43 | comment | added | Stefan Gyürki | OK, thank you. Our graphs are directed strongly regular graphs. | |
| May 23, 2015 at 13:31 | comment | added | Brendan McKay | @Stefan: All coloured graph isomorphism problems can be converted to uncoloured problems, so just the existence is not news, but it would nice if your construction is substantially different from the previous ones. | |
| May 23, 2015 at 12:43 | comment | added | Stefan Gyürki | I think we have such a construction without using colours. Are you aware of such result without colours? I couldn't find any reference neither in your paper, nor elsewhere. | |
| Oct 21, 2014 at 13:59 | comment | added | Brendan McKay | They are now on my Latin Squares page: cs.anu.edu.au/~bdm/data/latin.html | |
| Oct 20, 2014 at 20:44 | comment | added | Stefan Gyürki | I have checked homepages of Andries Brouwer, Patric Ostergard, Ted Spence, Ian Wanless and yours (Did I miss anybody?) but no such data been found. | |
| Oct 20, 2014 at 13:57 | comment | added | Brendan McKay | @Stefan: I'm not aware of such a list, though it would be routine to make them as there are only 23,746. If you can't find a list soon (or someone tells us where one is) let me know and I'll make them. | |
| Oct 20, 2014 at 11:21 | comment | added | Stefan Gyürki | Thank you very much. This knowledge is very helpful. btw. Is there known any available database of isomorphism classes of loops of order 7? From the LOOPS package of GAP I can get them systematically up to order 6. For higher orders it can generate a loop randomly, but not systematically. | |
| Oct 20, 2014 at 11:08 | vote | accept | Stefan Gyürki | ||
| Oct 20, 2014 at 6:13 | history | answered | Brendan McKay | CC BY-SA 3.0 |