Pages that link to "Item:Q3970964"
From MaRDI portal
The following pages link to On the decomposition of <i>K</i><sub><i>n</i></sub> into complete <i>m</i>‐partite graphs (Q3970964):
Displaying 19 items.
- A short proof of Fisher's inequality (Q686507) (← links)
- An unusual decomposition of a complete 7-partite graph of order 28 (Q941404) (← links)
- Decomposition of product graphs into complete bipartite subgraphs (Q1073047) (← links)
- Decompositions of complete multigraphs related to Hadamard matrices (Q1268621) (← links)
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
- Decompositions of complete multigraphs derived from Hadamard matrices (Q1399905) (← links)
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- Existence on splitting-balanced block designs with resolvability (Q2364419) (← links)
- Decomposition of an infinite complete graph into complete bipartite subgraphs (Q3335829) (← links)
- (Q3504736) (← links)
- Minimal decomposition of all graphs with equinumerous vertices and edges into mutually isomorphic subgraphs (Q3679223) (← links)
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs (Q3720624) (← links)
- Edge decompositions of the complete graph into copies of a connected subgraph (Q4085755) (← links)
- On the minimum number of edge‐disjoint complete <i>m</i>‐partite subgraphs into which <i>K<sub>n</sub></i> can be decomposed (Q4285594) (← links)
- (Q4374707) (← links)
- Sharp bounds for decompositions of graphs into completer-partite subgraphs (Q4879175) (← links)
- (Q5143810) (← links)
- (Q5193647) (← links)
- Decompositions of some regular graphs into unicyclic graphs of order five (Q5197547) (← links)
