Pages that link to "Item:Q5890921"

The following pages link to Many \(T\) copies in \(H\)-free graphs (Q5890921):

Displaying 9 items.

• On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
• The number of copies of \(K_{2,t+1}\) in a graph (Q2164991) (← links)
• Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
• Subgraph densities in \(K_r\)-free graphs (Q2699640) (← links)
• Tree densities in sparse graph classes (Q5046563) (← links)
• Turán Problems and Shadows III: Expansions of Graphs (Q5254084) (← links)
• Many \(T\) copies in \(H\)-free graphs (Q5965526) (← links)
• On the maximum number of copies of H in graphs with given size and order (Q6055379) (← links)
• The cycle of length four is strictly \(F\)-Turán-good (Q6090832) (← links)