Pages that link to "Item:Q6055379"
From MaRDI portal
The following pages link to On the maximum number of copies of H in graphs with given size and order (Q6055379):
Displaying 11 items.
- Graphs with many copies of a given subgraph (Q1010658) (← links)
- On the number of copies of one hypergraph in another (Q1264288) (← links)
- Maximizing the density of \(K_t\)'s in graphs of bounded degree and clique number (Q2174573) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- Reconstructing the number of copies of a valency‐labeled finite graph in an infinite graph (Q4284097) (← links)
- On a Conjecture of Nagy on Extremal Densities (Q5854460) (← links)
- On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory (Q6069164) (← links)
- Regular Turán numbers and some Gan–Loh–Sudakov‐type problems (Q6093139) (← links)
- The upper tail problem for induced 4‐cycles in sparse random graphs (Q6119225) (← links)
- Threshold graphs maximise homomorphism densities (Q6632807) (← links)
- On extremal values of some degree-based topological indices with a forbidden or a prescribed subgraph (Q6648287) (← links)
