The following pages link to Pentagons vs. triangles (Q941370):
Displaying 32 items.
- Large hypergraphs without tight cycles (Q5048449) (← 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)
- Nearly-Regular Hypergraphs and Saturation of Berge Stars (Q5210978) (← links)
- Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
- On Two Problems in Ramsey--Turán Theory (Q5351866) (← links)
- Extremal Results for Berge Hypergraphs (Q5371028) (← links)
- The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
- Many \(T\) copies in \(H\)-free graphs (Q5890921) (← links)
- Many \(T\) copies in \(H\)-free graphs (Q5965526) (← links)
- Extremal problems of double stars (Q6045457) (← links)
- Generalized Turán results for intersecting cliques (Q6056423) (← 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)
- Stability version of Dirac's theorem and its applications for generalized Turán problems (Q6096834) (← links)
- Maximum cliques in a graph without disjoint given subgraph (Q6117354) (← links)
- Every graph is eventually Turán-good (Q6170799) (← links)
- Book free 3-uniform hypergraphs (Q6177430) (← links)
- On \(3\)-uniform hypergraphs avoiding a cycle of length four (Q6197309) (← links)
- Exact generalized Turán number for \(K_3\) versus suspension of \(P_4\) (Q6197734) (← links)
- Local-vs-global combinatorics (Q6198642) (← links)
- Regular decomposition of the edge set of a graph with applications (Q6562433) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
- Many triangles in \(C_5\)-free graphs (Q6596197) (← links)
- On the generalized Turán problem for odd cycles (Q6606915) (← links)
- A localized approach to generalized Turán problems (Q6614190) (← links)
- Generalized Turán problems for even cycles (Q6621207) (← links)
- On the maximum number of odd cycles in graphs without smaller odd cycles (Q6621212) (← links)
- The maximum number of \(P_\ell\) copies in \(P_k\)-free graphs (Q6621215) (← links)
- On the Constructor-Blocker game (Q6667585) (← links)
