The inductive argument is more natural. The other approach is less natural, but it's not difficult to deduce once you think of adding the inequalities of the lemma, because you then know that you need to give rise to a larger power of E(G) to the right-hand side, which is usually done with C-S. Nice video!
Very nice! Since we know when the maximum is attained, I wonder if we could prove that any triangle-free graph has less edges than the corresponding bi-partite special graphs mentioned in the beginning of the presentation.
Excellent explanation, thank you Professor.
The inductive argument is more natural. The other approach is less natural, but it's not difficult to deduce once you think of adding the inequalities of the lemma, because you then know that you need to give rise to a larger power of E(G) to the right-hand side, which is usually done with C-S. Nice video!
There are a few other techniques too actually!
Thanks a lot Sir
Definitely!
Very nice! Since we know when the maximum is attained, I wonder if we could prove that any triangle-free graph has less edges than the corresponding bi-partite special graphs mentioned in the beginning of the presentation.
We actually definitely can Yannis :) Feel free to message me if you'd like to know more.
Thnx🤩