Timeline for Intuition on inequality in proving a bound on the sum of squares of degrees of a graph
Current License: CC BY-SA 4.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 5, 2022 at 16:34 | comment | added | Fedor Petrov | If we know the number of edges (and vertices), and want to bound the sum of squares of degrees, this means in terms of our $x_i$'s that lhs of 2) must be bounded in terms of the sum of variables (which must be squared if we want a homogeneous inequality) and the sum of their squares. Then you play with coefficients. | |
| Jul 5, 2022 at 15:49 | comment | added | AspiringMat | I get where you're going, but this sort of entails knowing Inequality 1 first (which is not obvious in itself). Having inequality 1 known, I can see how 2 is derived, but that doesn't exactly answer my question on how 2 would be known apriori. Thanks for the answer though. | |
| Jul 5, 2022 at 12:22 | history | answered | Fedor Petrov | CC BY-SA 4.0 |