Graph theory problem

Revision en2, by Mhn_Neek, 2024-06-24 12:18:59

Given a graph G s.t. any cycle in G has length 3.
1)Find the maximum number of edges. 2)Find the maximum number of cycles.

Tags graph theory

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Mhn_Neek 2024-06-24 12:18:59 35 Tiny change: 'Graph G doesn't have even cycle and any cycle' -> 'Given a graph G s.t. any cycle'
en1 English Mhn_Neek 2024-06-24 12:14:27 163 Initial revision (published)