Ononot — A graph is triangle-free if it contains no cycles of length

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theoryeasy

0:00.0

A graph is triangle-free if it contains no cycles of length 3. What is the maximum number of edges in a triangle-free graph with 6 vertices?