Timeline for Sum of degree differences for simple graphs
Current License: CC BY-SA 4.0
20 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 18, 2020 at 14:37 | history | suggested | RobPratt | CC BY-SA 4.0 |
added \deg and corrected typo
|
| Mar 18, 2020 at 14:35 | review | Suggested edits | |||
| S Mar 18, 2020 at 14:37 | |||||
| S Mar 16, 2020 at 9:33 | history | bounty ended | CommunityBot | ||
| S Mar 16, 2020 at 9:33 | history | notice removed | user153000 | ||
| S Mar 9, 2020 at 21:11 | history | bounty started | CommunityBot | ||
| S Mar 9, 2020 at 21:11 | history | notice added | user153000 | Improve details | |
| S Mar 9, 2020 at 21:10 | history | bounty ended | CommunityBot | ||
| S Mar 9, 2020 at 21:10 | history | notice removed | user153000 | ||
| Mar 4, 2020 at 19:51 | comment | added | user153000 | It is proven here: books.google.pl/… | |
| Mar 4, 2020 at 19:47 | comment | added | user153000 | This index $\mathcal{I_{n}}$ is a convex function of degree sequence $\mathcal {deg}x_{1},...,\mathcal{deg}x_{n}$. Call the set of all such graphic sequences $D$. Then we can look on $D^{*}=\mathcal{Con}D$ - a convex hull of $D$. $I_{n}$ must then attain it's maximum on some extreme point of $D^{*}$. It can be shown, that such extreme points of $D^{*}$ are exactly those corresponding to threshold graphs. | |
| Mar 4, 2020 at 19:09 | comment | added | Aaron Meyerowitz | How do you get that the maximum occurs for threshold graphs? I'm not doubting it but don't see it so I am just wondering how you would show it. | |
| S Mar 2, 2020 at 23:36 | history | bounty started | CommunityBot | ||
| S Mar 2, 2020 at 23:36 | history | notice added | user153000 | Improve details | |
| Mar 1, 2020 at 1:40 | answer | added | Aaron Meyerowitz | timeline score: 4 | |
| Feb 29, 2020 at 16:58 | comment | added | Martin Rubey | Divisibility by $4$ is easy (but tedious) to show by induction on the number of edges. | |
| Feb 29, 2020 at 15:46 | comment | added | Martin Rubey | actually, dmtcs.episciences.org/1263 considers your invariant with $3:=1$, which might be helpful. | |
| Feb 29, 2020 at 15:41 | comment | added | Martin Rubey | The "Albertson index" is a bit similar, see findstat.org/St001350 | |
| Feb 29, 2020 at 15:36 | comment | added | Martin Rubey | Is it obvious that this number is always divisible by four - for any value of 3? | |
| Feb 29, 2020 at 13:30 | review | First posts | |||
| Feb 29, 2020 at 13:40 | |||||
| Feb 29, 2020 at 13:26 | history | asked | user153000 | CC BY-SA 4.0 |