Pages that link to "Item:Q2200921"
From MaRDI portal
The following pages link to Generalized Turán problems for even cycles (Q2200921):
Displayed 31 items.
- Some sharp results on the generalized Turán numbers (Q2011146) (← links)
- On Turán-good graphs (Q2032868) (← links)
- Some results on \(k\)-Turán-good graphs (Q2037585) (← links)
- Generalized Turán number of even linear forests (Q2042218) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Generalized Turán problems for complete bipartite graphs (Q2084784) (← links)
- Generalized Turán densities in the hypercube (Q2099479) (← 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)
- Some exact results for generalized Turán problems (Q2136200) (← links)
- Spectral radius, edge-disjoint cycles and cycles of the same length (Q2138553) (← 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)
- Some extremal results on hypergraph Turán problems (Q2158853) (← links)
- The maximum number of copies of \(K_{r,s}\) in graphs without long cycles or paths (Q2236805) (← links)
- \(C_{2k}\)-saturated graphs with no short odd cycles (Q2334067) (← links)
- The maximum number of paths of length four in a planar graph (Q2659227) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- Generalized rainbow Turán numbers of odd cycles (Q2666563) (← links)
- Generalized Turán problems for \(K_{2,t}\) (Q2692171) (← links)
- Some exact results of the generalized Turán numbers for paths (Q2700989) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- The Generalized Rainbow Turán Problem for Cycles (Q5062108) (← links)
- $t$-Wise Berge and $t$-Heavy Hypergraphs (Q5128511) (← links)
- Many H-Copies in Graphs with a Forbidden Tree (Q5204067) (← links)
- The maximum number of triangles in \(F_k\)-free graphs (Q6056558) (← links)
- Triangles in C5‐free graphs and hypergraphs of girth six (Q6056790) (← links)
- On the maximum number of odd cycles in graphs without smaller odd cycles (Q6056808) (← links)
- The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
- The cycle of length four is strictly \(F\)-Turán-good (Q6090832) (← links)