Pages that link to "Item:Q2324501"
From MaRDI portal
The following pages link to Generalized Turán problems for disjoint copies of graphs (Q2324501):
Displaying 35 items.
- Turán numbers for disjoint copies of graphs (Q659740) (← links)
- Additive approximation of generalized Turán questions (Q832525) (← links)
- Turán function and \(H\)-decomposition problem for gem graphs (Q1649911) (← links)
- Some sharp results on the generalized Turán numbers (Q2011146) (← links)
- Some results on \(k\)-Turán-good graphs (Q2037585) (← links)
- Generalized Turán number of even linear forests (Q2042218) (← links)
- Turán problems for Berge-\((k, p)\)-fan hypergraph (Q2047221) (← links)
- Unified approach to the generalized Turán problem and supersaturation (Q2065917) (← links)
- Generalized Turán problems for complete bipartite graphs (Q2084784) (← links)
- Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
- The generalized Turán number of spanning linear forests (Q2115153) (← links)
- Extremal graphs for two vertex-disjoint copies of a clique (Q2117533) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- Some exact results for generalized Turán problems (Q2136200) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- Generalized Turán number for linear forests (Q2144592) (← links)
- On generalized Turán number of two disjoint cliques (Q2154554) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- The maximum number of cliques in hypergraphs without large matchings (Q2205126) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- The shifting method and generalized Turán number of matchings (Q2297913) (← links)
- Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
- Spectral extremal graphs for disjoint cliques (Q2684892) (← links)
- Generalized Turán problems for \(K_{2,t}\) (Q2692171) (← 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)
- Many \(T\) copies in \(H\)-free graphs (Q5965526) (← links)
- Generalized Turán problems for double stars (Q6041852) (← links)
- Extremal problems of double stars (Q6045457) (← links)
- On the maximum number of copies of H in graphs with given size and order (Q6055379) (← links)
- Generalized Turán results for intersecting cliques (Q6056423) (← links)
- Maximum cliques in a graph without disjoint given subgraph (Q6117354) (← links)
- The constructor-blocker game (Q6567845) (← links)
- On generalized Turán numbers of intersecting cliques (Q6661725) (← links)
