Timeline for Is there a 7-regular graph on 50 vertices with girth 5? What about 57-regular on 3250 vertices?
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 30, 2012 at 0:18 | comment | added | Mariano Suárez-Álvarez | I would love to know why exactly it is such a mysterious and exciting open problem! | |
| Nov 1, 2010 at 8:19 | history | edited | sleepless in beantown |
edited tags
|
|
| Oct 28, 2010 at 18:43 | comment | added | Gil Kalai | Indeed, the existence of a Moore graph of degree 57 is one of the most mysterious and exciting open problems in combinatorics. | |
| Oct 28, 2010 at 3:45 | answer | added | Aaron Meyerowitz | timeline score: 12 | |
| Oct 28, 2010 at 2:08 | vote | accept | David E Speyer | ||
| Oct 28, 2010 at 2:02 | answer | added | Hsien-Chih Chang 張顯之 | timeline score: 26 | |
| Oct 28, 2010 at 1:55 | comment | added | Harry Altman | Sorry, I mean Moore graphs of girth 5. | |
| Oct 28, 2010 at 1:50 | comment | added | Harry Altman | These are the Moore graphs, right? So 7 exists and 57 is unknown. | |
| Oct 28, 2010 at 1:42 | history | asked | David E Speyer | CC BY-SA 2.5 |