Pages that link to "Item:Q5126762"
From MaRDI portal
The following pages link to The maximum number of triangles in a graph of given maximum degree (Q5126762):
Displaying 17 items.
- Maximum vertex and face degree of oblique graphs (Q1044926) (← links)
- 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)
- A simple proof of the Gan-Loh-Sudakov conjecture (Q2088706) (← links)
- Supersaturation for subgraph counts (Q2117531) (← links)
- Generalized Turán number for linear forests (Q2144592) (← 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)
- (Q4792367) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- On the maximum number of open triangles in graphs with the same number of vertices and edges (Q5878612) (← links)
- The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems (Q6093139) (← links)
- Maximum cliques in a graph without disjoint given subgraph (Q6117354) (← links)
- Many Cliques in Bounded-Degree Hypergraphs (Q6170441) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)