Pages that link to "Item:Q760430"
From MaRDI portal
The following pages link to Hypergraphs in which all disjoint pairs have distinct unions (Q760430):
Displaying 22 items.
- Regular subgraphs of uniform hypergraphs (Q273181) (← links)
- Turán problems and shadows. I: Paths and cycles (Q472166) (← links)
- On disjointly representable sets (Q790112) (← links)
- Small maximally disjoint union-free families (Q941357) (← links)
- The maximum size of hypergraphs without generalized 4-cycles (Q1024366) (← links)
- Two-regular subgraphs of hypergraphs (Q1026004) (← links)
- Two-regular subgraphs of odd-uniform hypergraphs (Q1682214) (← links)
- A hypergraph extension of the bipartite Turán problem (Q1826942) (← links)
- Disjointly representing set systems (Q1873809) (← 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)
- Turán number of special four cycles in triple systems (Q2237241) (← links)
- Minimal paths and cycles in set systems (Q2372429) (← links)
- An intersection theorem for four sets (Q2383002) (← links)
- Constructing union-free pairs of \(k\)-element subsets (Q2443418) (← links)
- DISJOINT <i>r</i>-TUPLES IN AN <i>r</i>-GRAPH WITH GIVEN MAXIMUM DEGREE (Q3331252) (← links)
- Structure and stability of triangle-free set systems (Q3420310) (← links)
- The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle (Q4903265) (← links)
- Hypergraphs of Bounded Disjointness (Q4979845) (← links)
- Finding the shortest path for a Hypergraph (Q5866018) (← links)
- Extremal Problems for Hypergraph Blowups of Trees (Q6057807) (← links)