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):
Displayed 5 items.
- A short proof of Fisher's inequality (Q686507) (← links)
- Subsets of a finite set that almost always intersect each other in \(\lambda\) elements (Q1356776) (← links)
- Complete multipartite decompositions of complete graphs and complete \(n\)-partite graphs (Q1430968) (← links)
- Existence on splitting-balanced block designs with resolvability (Q2364419) (← links)
- Decompositions of some regular graphs into unicyclic graphs of order five (Q5197547) (← links)