Pages that link to "Item:Q1040837"
From MaRDI portal
The following pages link to On decompositions of complete hypergraphs (Q1040837):
Displaying 24 items.
- On the decomposition of random hypergraphs (Q684118) (← links)
- The de Bruijn-Erdős theorem for hypergraphs (Q690671) (← links)
- Decomposition of the complete hypergraph into delta-systems. I (Q1073045) (← links)
- Decomposition of large combinatorial structures (Q1107544) (← links)
- On complementary decompositions of the complete graph (Q1121285) (← links)
- Minimal decompositions of hypergraphs into mutually isomorphic subhypergraphs (Q1168335) (← links)
- On decomposing a hypergraph into \(k\) connected sub-hypergraphs (Q1410689) (← links)
- Decomposing the complete \(r\)-graph (Q1679321) (← links)
- Improved bounds for the Graham-Pollak problem for hypergraphs (Q1691097) (← links)
- Decomposition of regular hypergraphs (Q1691212) (← links)
- Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120) (← links)
- Multicovering hypergraphs (Q2022167) (← links)
- Emergence and dynamics of short food supply chains (Q2031240) (← links)
- Decomposing uniform hypergraphs into uniform hypertrees and single edges (Q2032883) (← links)
- A note on \(k\)-wise oddtown problems (Q2143418) (← links)
- Bounds for the Graham-Pollak theorem for hypergraphs (Q2324505) (← links)
- (Q3137219) (← links)
- (Q3403196) (← links)
- On perfect Γ-decompositions of the complete graph (Q3619611) (← links)
- (Q4224343) (← links)
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture (Q4376161) (← links)
- Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs (Q5199506) (← links)
- Query Complexity of Sampling and Small Geometric Partitions (Q5364254) (← links)
- Odd covers of graphs (Q6094037) (← links)