Timeline for Strongly rigid regular graphs
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 10, 2023 at 19:54 | answer | added | Kolja Knauer | timeline score: 1 | |
| Jan 19, 2019 at 7:47 | vote | accept | Dominic van der Zypen | ||
| Jan 19, 2019 at 2:14 | answer | added | Chris Godsil | timeline score: 9 | |
| Jan 18, 2019 at 15:59 | comment | added | M. Winter | Related: mathoverflow.net/q/296483/108884. I also have the feeling that you got part of an answer there already. | |
| Jan 18, 2019 at 7:12 | vote | accept | Dominic van der Zypen | ||
| Jan 19, 2019 at 7:47 | |||||
| S Jan 18, 2019 at 2:50 | history | edited | YCor | CC BY-SA 4.0 |
changed homomorphism to endomorphism
|
| Jan 17, 2019 at 22:53 | comment | added | Gordon Royle | A homomorphism is a map between two graphs, so it makes no sense to use the word when there is just one graph. Perhaps you mean endomorphism which is a homomorphism from a graph to itself. The distinction is analogous to the distinction between isomorphism (two graphs) and automorphism (one graph). | |
| Jan 17, 2019 at 21:29 | review | Suggested edits | |||
| S Jan 18, 2019 at 2:50 | |||||
| Jan 17, 2019 at 19:40 | comment | added | Fedor Petrov | I bet that random $k$-regular graphs are rigid with probability almost 1, and possibly this is even proved in Bollobas' book. | |
| Jan 17, 2019 at 18:59 | answer | added | Taras Banakh | timeline score: 4 | |
| Jan 17, 2019 at 18:33 | comment | added | Taras Banakh | @DominicvanderZypen It is not very difficult to construct an infinite strongly rigid $k$-regular graph for every $k\ge 3$. Unfortunately, it requires some space (and time) to describe the construction. | |
| Jan 17, 2019 at 18:26 | comment | added | Taras Banakh | Dou you consider only finite graphs, or infinite also are allowed? | |
| Jan 17, 2019 at 16:54 | comment | added | Dominic van der Zypen | Good point @M.Winter - I don't...! | |
| Jan 17, 2019 at 16:06 | comment | added | M. Winter | It would be interesting whether you already know the answer for any $k\ge 3$? | |
| Jan 17, 2019 at 13:15 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |