Pages that link to "Item:Q5226834"
From MaRDI portal
The following pages link to The maximum number of $P_\ell$ copies in $P_k$-free graphs (Q5226834):
Displaying 19 items.
- Some results on \(k\)-Turán-good graphs (Q2037585) (← links)
- Unified approach to the generalized Turán problem and supersaturation (Q2065917) (← links)
- The maximum number of stars in a graph without linear forest (Q2093100) (← links)
- Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
- Supersaturation for subgraph counts (Q2117531) (← links)
- Some exact results for generalized Turán problems (Q2136200) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- Many H-Copies in Graphs with a Forbidden Tree (Q5204067) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- Ordering \(Q\)-indices of graphs: given size and circumference (Q6056721) (← links)
- The maximum number of paths of length three in a planar graph (Q6057639) (← 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)
- Stability version of Dirac's theorem and its applications for generalized Turán problems (Q6096834) (← links)
- Random polynomial graphs for random Turán problems (Q6143381) (← links)
- The constructor-blocker game (Q6567845) (← links)
- Generalized regular Turán numbers (Q6644902) (← links)
