Timeline for "Antipodal" maps on regular graphs?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Sep 29, 2011 at 20:04 | answer | added | Alain Valette | timeline score: 1 | |
| May 12, 2011 at 15:54 | answer | added | Roland Bacher | timeline score: 4 | |
| May 12, 2011 at 15:34 | vote | accept | Alain Valette | ||
| May 12, 2011 at 12:43 | comment | added | Roland Bacher | The case $D=2$ is equivalent to question mathoverflow.net/questions/64770/…, motivated by my failure to find a small counterexample. | |
| May 12, 2011 at 8:36 | comment | added | Roland Bacher | This question can be reformulated as follows: given a regular graph $A$ of diameter $D$ such that every vertex of $A$ is at distance $D$ from some other vertex, we construct a new graph $B$ with the same vertices as $A$ and with edges corresponding to vertices at distance $D$ in $A$. Can we always find a collection of disjoint edges and cycles in $B$ which contain all vertices? | |
| May 12, 2011 at 6:38 | answer | added | Gerhard Paseman | timeline score: 5 | |
| May 12, 2011 at 6:32 | comment | added | Clinton Conley | For your parenthetical subquestion, it appears to me that this condition is the same the graph's radius equaling its diameter. | |
| May 12, 2011 at 5:19 | history | asked | Alain Valette | CC BY-SA 3.0 |