Pages that link to "Item:Q3826589"
From MaRDI portal
The following pages link to Lower bounds on the number of triangles in a graph (Q3826589):
Displayed 12 items.
- On the location of roots of independence polynomials (Q596652) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- Bounds on the number of complete subgraphs (Q1195482) (← links)
- Bounds on the largest root of the matching polynomial (Q1208371) (← links)
- The maximum number of triangles in a \(K_4\)-free graph (Q1297475) (← links)
- On graphs in which any pair of colour classes but one induces a tree (Q1357722) (← links)
- On the structure and chromaticity of graphs in which any two colour classes induce a tree (Q1377681) (← links)
- Roots of independence polynomials of well covered graphs (Q1577528) (← links)
- On the Minimal Density of Triangles in Graphs (Q3527546) (← links)
- The largest eigenvalue of a graph: A survey (Q4713877) (← links)
- (Q4946543) (← links)
- Flag algebras (Q5444699) (← links)