Pages that link to "Item:Q1297475"
From MaRDI portal
The following pages link to The maximum number of triangles in a \(K_4\)-free graph (Q1297475):
Displaying 10 items.
- Cliques in graphs excluding a complete graph minor (Q311514) (← links)
- On the maximum number of cliques in a graph embedded in a surface (Q648982) (← links)
- Face vectors of flag complexes (Q940742) (← links)
- A Kruskal-Katona type theorem for graphs (Q966066) (← links)
- On the maximum number of cliques in a graph (Q995772) (← links)
- A new Turán-type theorem for cliques in graphs (Q1827735) (← links)
- Many triangles with few edges (Q2420564) (← links)
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- On clique values identities and mantel-type theorems (Q5139344) (← links)
