Timeline for Regularization of arbitrary graphs
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 22, 2019 at 10:05 | review | Close votes | |||
| May 27, 2019 at 18:33 | |||||
| May 22, 2019 at 7:53 | comment | added | fedja | @FedorPetrov Indeed, you are right. The correction is trivial (add some edges sticking out to saturate the existing vertices and consider the new graph), but then it basically becomes your construction. | |
| May 22, 2019 at 7:36 | comment | added | Fedor Petrov | @fedja well, but the complement should avoid existed edges, right? | |
| May 22, 2019 at 7:31 | comment | added | fedja | @FedorPetrov $d_j$ are $\Delta$ minus the existing degrees, i.e., I'm looking for the complement. I thought that was clear enough :-) | |
| May 22, 2019 at 7:29 | comment | added | Fedor Petrov | @fedja not quite just graphic sequence, we should save the existed edges | |
| May 22, 2019 at 7:28 | vote | accept | Dominic van der Zypen | ||
| May 22, 2019 at 7:27 | answer | added | Fedor Petrov | timeline score: 4 | |
| May 22, 2019 at 7:23 | comment | added | fedja | In other words, if $\Delta\ge d_1\ge d_2\ge\dots d_n\ge 0$, then $\Delta,\dots \Delta, d_1\dots d_n$ is a graphic sequence for some number of repetitions of $\Delta$. Looks obvious, doesn't it? | |
| May 22, 2019 at 6:37 | history | asked | Dominic van der Zypen | CC BY-SA 4.0 |