Pages that link to "Item:Q1024366"
From MaRDI portal
The following pages link to The maximum size of hypergraphs without generalized 4-cycles (Q1024366):
Displayed 10 items.
- Regular subgraphs of uniform hypergraphs (Q273181) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- Two-regular subgraphs of odd-uniform hypergraphs (Q1682214) (← links)
- Relative Turán numbers for hypergraph cycles (Q2043404) (← links)
- Finding a minimal spanning hypertree of a weighted hypergraph (Q2168776) (← links)
- New bounds for a hypergraph bipartite Turán problem (Q2194765) (← links)
- The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle (Q4903265) (← links)
- Finding the shortest path for a Hypergraph (Q5866018) (← links)
- Extremal Problems for Hypergraph Blowups of Trees (Q6057807) (← links)