Pages that link to "Item:Q5965526"
From MaRDI portal
The following pages link to Many \(T\) copies in \(H\)-free graphs (Q5965526):
Displaying 50 items.
- The shifting method and generalized Turán number of matchings (Q2297913) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- Counting copies of a fixed subgraph in \(F\)-free graphs (Q2323254) (← links)
- Generalized Turán problems for disjoint copies of graphs (Q2324501) (← links)
- \(C_{2k}\)-saturated graphs with no short odd cycles (Q2334067) (← links)
- Forbidden families of minimal quadratic and cubic configurations (Q2363111) (← links)
- The maximum number of paths of length four in a planar graph (Q2659227) (← links)
- Forbidding \(K_{2,t}\) traces in triple systems (Q2662345) (← links)
- Generalized planar Turán numbers (Q2665977) (← links)
- Generalized rainbow Turán numbers of odd cycles (Q2666563) (← links)
- On the abstract chromatic number and its computability for finitely axiomatizable theories (Q2668017) (← links)
- Turán problems for \(k\)-geodetic digraphs (Q2689115) (← links)
- Generalized Turán problems for \(K_{2,t}\) (Q2692171) (← links)
- Subgraph densities in \(K_r\)-free graphs (Q2699640) (← links)
- Triangles in graphs without bipartite suspensions (Q2699921) (← links)
- Some exact results of the generalized Turán numbers for paths (Q2700989) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- On the Number of Cycles in a Graph with Restricted Cycle Lengths (Q4602855) (← links)
- The Turán Number of Berge K_4 in Triple Systems (Q4627478) (← links)
- Induced Turán Numbers (Q4643317) (← links)
- A note on the Tur\'an number of a Berge odd cycle (Q4990118) (← links)
- Minimizing the Number of Edges in $K_{(s,t)}$-Saturated Bipartite Graphs (Q4992838) (← links)
- Rainbow cycles vs. rainbow paths (Q5026970) (← links)
- Tree densities in sparse graph classes (Q5046563) (← links)
- The Generalized Rainbow Turán Problem for Cycles (Q5062108) (← links)
- On Generalized Turán Results in Height Two Posets (Q5088600) (← links)
- $t$-Wise Berge and $t$-Heavy Hypergraphs (Q5128511) (← links)
- Lower bounds for rainbow Tur\'{a}n numbers of paths and other trees (Q5139689) (← links)
- Many H-Copies in Graphs with a Forbidden Tree (Q5204067) (← links)
- Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
- On Two Problems in Ramsey--Turán Theory (Q5351866) (← links)
- Improved Bounds on Sizes of Generalized Caps in $AG(n,q)$ (Q5857007) (← links)
- The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
- Generalizations of the Ruzsa–Szemerédi and rainbow Turán problems for cliques (Q5886100) (← links)
- Subgraph densities in a surface (Q5886343) (← links)
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs (Q5915815) (← links)
- Uniformity thresholds for the asymptotic size of extremal Berge-\(F\)-free hypergraphs (Q5918876) (← 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)
- On supersaturation and stability for generalized Turán problems (Q6055938) (← links)
- Generalized Turán results for intersecting cliques (Q6056423) (← links)
- The Turán number of Berge hypergraphs with stable properties (Q6056469) (← 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 paths of length three in a planar graph (Q6057639) (← links)
- (Q6072061) (← links)
- The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
- A stability theorem for maximal C2k+1 ${C}_{2k+1}$‐free graphs (Q6081589) (← links)