-
Why do we choose the base case to be n <= d/f(d) ?
-
For equation (2), in expectation terms, LHS of (2) >= LHS (1) (of equation (1)) as $d_1^2 \geq d^2$ and since $d_1 \geq 0$, we have $d_1 \geq d$ but why does the theorem claim they're equal?
-
For the RHS of equation (2), in expectation we have:
$dd_1 + d - 2d_1d_2 = dd_1 + d - 2d_1^2$
But then $d_1 \geq d$ so we can write $dd_1 \geq d^2$ for the first term but we have a negative term in front of the $2d_1^2$ so we can't obtain the claimed inequality?
#Minimal result on independence number of triangle free graphs
6 messages · Page 1 of 1 (latest)
- Do not ping the Moderators, unless someone is breaking the rules.
- Do not ping the Helper Moderators, unless there is a conflict between helpers.
- Do not ping other members randomly for help.
- Ask your question and show the work you've done so far. If you've posted a screenshot of a question, specify which part you need help with.
- Wait patiently for a helper to come along.
- If the Helper has answered your question, remember to thank them with the Mathematics Ranks bot and close the thread with:
+close
Feel free to nominate the person for helper of the week in #helper-nominations
If you're happy with the help you got here, and the server overall, you can contribute financially as well:
Laiika
For those wishing to contribute, I have posted my question on maths stack: https://math.stackexchange.com/questions/5035212/minimal-bound-on-the-independence-number-of-triangle-free-graphs
Mathematics Stack Exchange
I am trying to understand Theorem 1 of James B. Shearer https://www.sciencedirect.com/science/article/pii/0012365X8390273X?via%3Dihub
Theorem Let G be a graph on n vertices, and $\alpha$ denote the
@weak breach
:HelpIcon:| Help Reminder
Hello laiika_, this is a friendly reminder that your help request has been inactive for more than 24 hours. If you no longer need assistance, please consider closing the thread using the +close command. This thread will be automatically closed in 3 days if it remains inactive.