Pages that link to "Item:Q5232163"
From MaRDI portal
The following pages link to Hypergraphs with Few Berge Paths of Fixed Length between Vertices (Q5232163):
Displaying 11 items.
- On the maximum size of connected hypergraphs without a path of given length (Q724883) (← links)
- Hypergraph extensions of the Erdős-Gallai theorem (Q739066) (← links)
- General lemmas for Berge-Turán hypergraph problems (Q1987076) (← links)
- Connected hypergraphs without long Berge-paths (Q2033897) (← links)
- A note on the uniformity threshold for Berge hypergraphs (Q2145761) (← links)
- Some extremal results on hypergraph Turán problems (Q2158853) (← links)
- Some tight lower bounds for Turán problems via constructions of multi-hypergraphs (Q2198988) (← links)
- Graphs with few paths of prescribed length between any two vertices (Q5110588) (← links)
- Random polynomial graphs for random Turán problems (Q6143381) (← links)
- Extremal graphs without exponentially small bicliques (Q6610106) (← links)
- A polynomial resultant approach to algebraic constructions of extremal graphs (Q6668587) (← links)