Pages that link to "Item:Q1297475"

The following pages link to The maximum number of triangles in a \(K_4\)-free graph (Q1297475):

Displayed 4 items.

• Face vectors of flag complexes (Q940742) ‎ (← links)
• On the maximum number of cliques in a graph (Q995772) ‎ (← links)
• A new Turán-type theorem for cliques in graphs (Q1827735) ‎ (← links)
• The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\) (Q2494102) ‎ (← links)