The following pages link to Pentagons vs. triangles (Q941370):
Displaying 50 items.
- On regular hypergraphs of high girth (Q405152) (← links)
- Hypergraphs with no cycle of length 4 (Q411654) (← links)
- 3-uniform hypergraphs avoiding a given odd cycle (Q452824) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- On 3-uniform hypergraphs without a cycle of a given length (Q516784) (← links)
- Supersaturation of \(C_4\): from Zarankiewicz towards Erdős-Simonovits-Sidorenko (Q1621060) (← links)
- Degenerate Turán problems for hereditary properties (Q1630890) (← links)
- Planar polynomials and an extremal problem of Fischer and Matoušek (Q1682210) (← links)
- The maximum number of cliques in graphs without long cycles (Q1682216) (← links)
- On \(r\)-uniform linear hypergraphs with no Berge-\(K_{2,t}\) (Q1684649) (← links)
- A note on the maximum number of triangles in a \(C_5\)-free graph (Q1689946) (← links)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- Cycles of given lengths in hypergraphs (Q1791703) (← links)
- Turán numbers for Berge-hypergraphs and related extremal problems (Q1999723) (← links)
- Saturation of Berge hypergraphs (Q1999741) (← links)
- Some sharp results on the generalized Turán numbers (Q2011146) (← links)
- On Turán-good graphs (Q2032868) (← links)
- Generalized Turán number of even linear forests (Q2042218) (← links)
- Maximizing five-cycles in \(K_r\)-free graphs (Q2048348) (← links)
- Generalized outerplanar Turán number of short paths (Q2092428) (← links)
- The maximum number of stars in a graph without linear forest (Q2093100) (← links)
- Generalized Turán densities in the hypercube (Q2099479) (← links)
- Counting cliques in 1-planar graphs (Q2111191) (← links)
- Paths of length three are \(K_{r+1}\)-Turán-good (Q2121716) (← links)
- Some exact results for generalized Turán problems (Q2136200) (← links)
- Generalized rainbow Turán problems (Q2144330) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- Generalized Turán number for linear forests (Q2144592) (← links)
- On generalized Turán number of two disjoint cliques (Q2154554) (← links)
- 3-uniform hypergraphs without a cycle of length five (Q2182003) (← links)
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs (Q2198988) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Maximising the number of cycles in graphs with forbidden subgraphs (Q2222049) (← 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)
- 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)
- Turán problems for \(k\)-geodetic digraphs (Q2689115) (← links)
- Triangles in graphs without bipartite suspensions (Q2699921) (← links)
- Hypergraphs with no odd cycle of given length (Q2851489) (← links)
- The Maximum Number of Triangles in <i>C</i><sub>2<i>k</i>+1</sub>-Free Graphs (Q2883861) (← links)
- Hypergraphs with No Cycle of a Given Length (Q2883862) (← links)
- On the Number of Cycles in a Graph with Restricted Cycle Lengths (Q4602855) (← links)
- On Tight Cycles in Hypergraphs (Q4614939) (← links)
- Induced Turán Numbers (Q4643317) (← links)
- A note on the Tur\'an number of a Berge odd cycle (Q4990118) (← links)
- Ramsey Numbers for Nontrivial Berge Cycles (Q5020835) (← links)
