Pages that link to "Item:Q724883"
From MaRDI portal
The following pages link to On the maximum size of connected hypergraphs without a path of given length (Q724883):
Displaying 14 items.
- Connected graphs without long paths (Q941391) (← links)
- Connected hypergraphs without long Berge-paths (Q2033897) (← links)
- Asymptotics for the Turán number of Berge-\(K_{2,t}\) (Q2312610) (← links)
- On 2-connected hypergraphs with no long cycles (Q2335701) (← 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)
- Ramsey Problems for Berge Hypergraphs (Q5215899) (← links)
- Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6201910) (← links)
- Exact results on generalized Erdős-Gallai problems (Q6568830) (← links)
- A Dirac-type theorem for uniform hypergraphs (Q6580493) (← links)
- Stability of extremal connected hypergraphs avoiding Berge-paths (Q6604682) (← links)
- The structure of hypergraphs without long Berge cycles (Q6621214) (← links)
- Linear three-uniform hypergraphs with no Berge path of given length (Q6661601) (← links)
