consider the tournament good if the outdegree of all vertices is d and number of common outdegree neighbors of each 2 vertices is L, consider a good tournament G that has n vertices
a)prove that each edge of G is in exactly (n-3)/4 directed triangle
b)the number of directed triangles in terms of n.
c)assume n=11. T(G) is the minimum number of edges that need to be removed such that the remaining graph doesn't contain a directed cycle. prove T(G) > c(n,2)/3
My attempt: for part a get 2 vertices and consider the edges between their indegree and outdegree neighbours(and each 2 vertices have the same indegree too) and for part b I wanted to use double-counting using the proof of the first part and I'm stuck in part c