Extremal problems under dimension constraints.

DOI10.1016/S0012-365X(03)00225-5MaRDI QIDQ1417564zbMATH OpenOpenAlexFDO

Authors Harout Aydinian, Levon H. Khachatrian, Rudolf Ahlswede

Publication date 5 January 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(03)00225-5

zbMATH Keywords

antichainsdiametric, isoperimetric and shadow problemsextremal algebraic theoryhigher order incidence matricesintersecting systems with weightspacking and covering

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Recommendations

• Maximal antichains under dimension constraints
• scientific article; zbMATH DE number 938819
• Problems and results in extremal combinatorics. I.
• Problems and results in extremal combinatorics. III.
• scientific article; zbMATH DE number 3551311

Cites work

• Beyond the Erdős-Ko-Rado theorem
• Communication Complexity
• Contributions to the geometry of Hamming spaces
• Erdös–Ko–Rado Theorem—22 Years Later
• Forbidden (0, 1)-vectors in hyperplanes of \(\mathbb{R}^n\): The restricted case
• scientific article; zbMATH DE number 3685654 (Why is no real title available?)
• scientific article; zbMATH DE number 3732068 (Why is no real title available?)
• scientific article; zbMATH DE number 3561362 (Why is no real title available?)
• scientific article; zbMATH DE number 1303528 (Why is no real title available?)
• scientific article; zbMATH DE number 736295 (Why is no real title available?)
• scientific article; zbMATH DE number 1016362 (Why is no real title available?)
• scientific article; zbMATH DE number 863493 (Why is no real title available?)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersection theorems for systems of finite sets
• Matrices of zeros and ones with fixed row and column sum vectors
• Matrix rank and communication complexity
• Maximum number of constant weight vertices of the unit \(n\)-cube contained in a \(k\)-dimensional subspace
• On a combinatorial conjecture of Erdös
• On rank vs. communication complexity
• On the minimum rank of regular classes of matrices of zeros and ones
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem

Cited in

(6)

• Maximal antichains under dimension constraints
• Intersection patterns of linear subspaces with the hypercube
• Intersection theorems under dimension constraints
• Forbidden \((0,1)\)-vectors in hyperplanes of \(\mathbb R^n\): the unrestricted case
• Extremum Problems With Total Variation Distance and Their Applications
• A subspace covering problem in the n-cube

This page was built for publication: Extremal problems under dimension constraints.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1417564)