Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace

DOI10.1007/s00493-003-0011-6zbMath1046.05076OpenAlexW2072189964MaRDI QIDQ1878586

Levon H. Khachatrian, Harout Aydinian, Rudolf Ahlswede

Publication date: 7 September 2004

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-003-0011-6

zbMATH Keywords

extremal set theory

Mathematics Subject Classification ID

Extremal set theory (05D05) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (9)

Intersection theorems under dimension constraints ⋮ On the rank of higher inclusion matrices ⋮ Extremal problems under dimension constraints. ⋮ Maximal antichains under dimension constraints ⋮ Projection-forcing multisets of weight changes ⋮ Intersection patterns of linear subspaces with the hypercube ⋮ A subspace covering problem in the \(n\)-cube ⋮ A strong connectivity property of the generalized exchanged hypercube ⋮ Extremal problems under dimension constraints

This page was built for publication: Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace