Pages that link to "Item:Q516784"
From MaRDI portal
The following pages link to On 3-uniform hypergraphs without a cycle of a given length (Q516784):
Displayed 28 items.
- 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)
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs (Q1713504) (← links)
- Cycles of given lengths in hypergraphs (Q1791703) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- Saturation of Berge hypergraphs (Q1999741) (← links)
- Spectral extremal results for hypergraphs (Q2049621) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- Multicolor Turán numbers (Q2144522) (← links)
- 3-uniform hypergraphs without a cycle of length five (Q2182003) (← links)
- Generalized Turán problems for even cycles (Q2200921) (← links)
- Turán number of special four cycles in triple systems (Q2237241) (← links)
- Limiting distribution of short cycles in inhomogeneous random uniform hypergraph (Q2244457) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- On the weight of Berge-\(F\)-free hypergraphs (Q2327220) (← 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)
- On Tight Cycles in Hypergraphs (Q4614939) (← links)
- The Turán Number of Berge K_4 in Triple Systems (Q4627478) (← links)
- A note on the Tur\'an number of a Berge odd cycle (Q4990118) (← links)
- $t$-Wise Berge and $t$-Heavy Hypergraphs (Q5128511) (← links)
- Nearly-Regular Hypergraphs and Saturation of Berge Stars (Q5210978) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← 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 (Q5965526) (← 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)