The following pages link to Many triangles with few edges (Q2420564):
Displaying 11 items.
- Many cliques with few edges and bounded maximum degree (Q1984508) (← links)
- The maximum number of induced open triangles in graphs of a given order (Q2010145) (← links)
- Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (Q2174573) (← links)
- Many cliques with few edges (Q2223482) (← links)
- The Maximum Number of Complete Subgraphs of Fixed Size in a Graph with Given Maximum Degree (Q2958203) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- The maximum number of triangles in a graph of given maximum degree (Q5126762) (← links)
- The maximum number of triangles in a graph and its relation to the size of the Schur multiplier of special <i>p</i>-groups (Q6042694) (← links)
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems (Q6093139) (← links)
- Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
