Timeline for What's the worst case for strongly regular graph's isomorphism algorithm?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 7 at 3:21 | comment | added | shen lixing | @BrendanMcKay Thank you, you are right. There is a gap between my "prove". | |
| S Jan 6 at 9:53 | review | First answers | |||
| Jan 6 at 9:57 | |||||
| S Jan 6 at 9:53 | history | edited | Daniele Tampieri | CC BY-SA 4.0 |
Typo corrected
|
| Jan 6 at 9:51 | comment | added | Daniele Tampieri | The DOI cannot be resolved: I added a direct link to the cited paper, though it may get "old". | |
| Jan 6 at 9:28 | history | edited | Daniele Tampieri | CC BY-SA 4.0 |
Minor Math Jaxing and formatting
|
| Jan 6 at 1:54 | comment | added | Brendan McKay | Is $M$ a matrix with every element equal to $m$? If so your claim fails for every pair of graphs that are cospectral with cospectral complements. There are many such pairs, for example any pair of cospectral regular graphs. | |
| Jan 6 at 1:41 | review | Low quality posts | |||
| Jan 6 at 9:28 | |||||
| S Jan 6 at 0:54 | review | First answers | |||
| Jan 6 at 1:33 | |||||
| S Jan 6 at 0:54 | history | answered | shen lixing | CC BY-SA 4.0 |