Uniformly deep families of k-membered subsets of n
From MaRDI portal
Publication:1234699
DOI10.1016/0097-3165(77)90060-7zbMath0349.05025OpenAlexW2042278799MaRDI QIDQ1234699
Publication date: 1977
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(77)90060-7
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Other combinatorial set theory (03E05)
Related Items (4)
Maximal coplanar sets of intersection points ⋮ Cyclic designs and uniformly deep families ⋮ Projective \((2n,n,\lambda,1)\)-designs ⋮ On coverings of a finite set: Depth and subcovers
Cites Work
This page was built for publication: Uniformly deep families of k-membered subsets of n
