1
$\begingroup$

In a simple graph, how many edges are needed if at least there is an edge among any 3 vertices?

$\endgroup$
2
$\begingroup$

If a graph has at least one edge among any $3$ vertices, then the complementary graph contains no triangle, and vice versa. What is the most edges an $n$-vertex (simple) graph can have without containing a triangle? [*] Subtract from $\binom n2$.

[*] Hint: Mantel, Turán.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.