Pages that link to "Item:Q2236805"
From MaRDI portal
The following pages link to The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805):
Displaying 5 items.
- Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (Q6069164) (← 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)
- The maximum number of cliques in graphs with prescribed order, circumference and minimum degree (Q6171501) (← links)