Pages that link to "Item:Q2236805"

The following pages link to The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805):

Displaying 3 items.

• Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
• The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
• A note on maximum size of a graph without isolated vertices under the given matching number (Q6095058) (← links)