Pages that link to "Item:Q2297913"
From MaRDI portal
The following pages link to The shifting method and generalized Turán number of matchings (Q2297913):
Displaying 15 items.
- Generalized Turán number of even linear forests (Q2042218) (← 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)
- The generalized Turán number of spanning linear forests (Q2115153) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- Generalized Turán number for linear forests (Q2144592) (← 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 maximum spectral radius of graphs without spanning linear forests (Q2680576) (← links)
- Many H-Copies in Graphs with a Forbidden Tree (Q5204067) (← links)
- Maximum cliques in a graph without disjoint given subgraph (Q6117354) (← links)
- Exact generalized Turán numbers for even linear forests (Q6542010) (← links)
- Spectral radius and rainbow Hamilton paths of a graph (Q6570051) (← links)
- A note on the stability results of the number of cliques in graphs with given matching number (Q6585273) (← links)
- Turán numbers of general star forests in hypergraphs (Q6635085) (← links)