Pages that link to "Item:Q739066"
From MaRDI portal
The following pages link to Hypergraph extensions of the Erdős-Gallai theorem (Q739066):
Displayed 39 items.
- Tight cycles in hypergraphs (Q322350) (← links)
- Tight cycles and regular slices in dense hypergraphs (Q516070) (← links)
- On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
- Minimum degree of 3-graphs without long linear paths (Q776262) (← links)
- On the cover Ramsey number of Berge hypergraphs (Q776301) (← links)
- An Erdős-Gallai type theorem for uniform hypergraphs (Q1686258) (← links)
- Forcing large tight components in 3-graphs (Q1715624) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- The structure of hypergraphs without long Berge cycles (Q1998768) (← links)
- Turán numbers for Berge-hypergraphs and related extremal problems (Q1999723) (← links)
- Saturation of Berge hypergraphs (Q1999741) (← links)
- Connected hypergraphs without long Berge-paths (Q2033897) (← links)
- Turán problems for Berge-\((k, p)\)-fan hypergraph (Q2047221) (← links)
- Hypergraph based Berge hypergraphs (Q2062896) (← links)
- Turán numbers for hypergraph star forests (Q2122689) (← links)
- The Turán number of Berge-matching in hypergraphs (Q2142638) (← links)
- On Berge-Ramsey problems (Q2185230) (← links)
- Linear Turán numbers of acyclic triple systems (Q2237863) (← links)
- On extremal hypergraphs for forests of tight paths (Q2279249) (← links)
- On \(r\)-uniform hypergraphs with circumference less than \(r\) (Q2309554) (← links)
- Avoiding long Berge cycles (Q2312601) (← 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)
- On the weight of Berge-\(F\)-free hypergraphs (Q2327220) (← links)
- On 2-connected hypergraphs with no long cycles (Q2335701) (← links)
- Turán numbers of complete 3-uniform Berge-hypergraphs (Q2413629) (← links)
- Linearity of saturation for Berge hypergraphs (Q2422222) (← links)
- Turán numbers of Berge trees (Q2685321) (← links)
- On Tight Cycles in Hypergraphs (Q4614939) (← links)
- Avoiding long Berge cycles: the missing cases <i>k</i> = <i>r</i> + 1 and <i>k</i> = <i>r</i> + 2 (Q4993098) (← links)
- $t$-Wise Berge and $t$-Heavy Hypergraphs (Q5128511) (← links)
- Longest Paths in Random Hypergraphs (Q5163510) (← links)
- Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs (Q5212951) (← links)
- Ramsey Problems for Berge Hypergraphs (Q5215899) (← links)
- Extremal Results for Berge Hypergraphs (Q5371028) (← links)
- Induced Turán problems and traces of hypergraphs (Q6116407) (← links)
- Book free 3-uniform hypergraphs (Q6177430) (← links)
- On Ramsey numbers of 3-uniform Berge cycles (Q6197744) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6201910) (← links)