Pages that link to "Item:Q1821120"
From MaRDI portal
The following pages link to Decomposition of the complete r-graph into complete r-partite r-graphs (Q1821120):
Displaying 20 items.
- On the decomposition of random hypergraphs (Q684118) (← links)
- The de Bruijn-Erdős theorem for hypergraphs (Q690671) (← links)
- An unusual decomposition of a complete 7-partite graph of order 28 (Q941404) (← links)
- On decompositions of complete hypergraphs (Q1040837) (← links)
- Multicolored forests in bipartite decompositions of graphs (Q1186126) (← links)
- Decomposing complete graphs into \(K_{r} \times K_{c}\)'s. (Q1417807) (← links)
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- Decomposing the complete \(r\)-graph (Q1679321) (← links)
- On a problem of Erdős and Moser (Q1688260) (← links)
- Improved bounds for the Graham-Pollak problem for hypergraphs (Q1691097) (← links)
- Multicovering hypergraphs (Q2022167) (← links)
- On the number of linear multipartite hypergraphs with given size (Q2053710) (← links)
- A note on \(k\)-wise oddtown problems (Q2143418) (← links)
- Bounds for the Graham-Pollak theorem for hypergraphs (Q2324505) (← links)
- \(H\)-decompositions of \(r\)-graphs when \(H\) is an \(r\)-graph with exactly 2 edges (Q2380474) (← links)
- Partition-Crossing Hypergraphs (Q4584655) (← links)
- Coverings of r—graphs by complete r—partite subgraphs (Q4697821) (← links)
- Sharp bounds for decompositions of graphs into completer-partite subgraphs (Q4879175) (← 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)
