2 problems

Let $n\geq 3$ and let $(d_1,\ldots,d_n)$ be a sequence of integers satisfying … … and … Here a triangular simple graph is a simple graph in which every edge is contained in a trian…

For $m\geq 6$, let $T(m)$ be the triangular graph, whose vertices are the $2$-subsets of $[m]$ and where two vertices are adjacent exactly when the corresponding subsets intersect…