Extremal problems under dimension constraints.

DOI10.1016/S0012-365X(03)00225-5zbMath1034.05048OpenAlexW2099440393MaRDI QIDQ1417564

Harout Aydinian, Levon H. Khachatrian

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

antichainspacking and coveringdiametric, isoperimetric and shadow problemsextremal algebraic theoryhigher order incidence matricesintersecting systems with weights

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05)

Related Items (4)

Intersection theorems under dimension constraints ⋮ Intersection patterns of linear subspaces with the hypercube ⋮ A subspace covering problem in the \(n\)-cube ⋮ Forbidden \((0,1)\)-vectors in hyperplanes of \(\mathbb R^n\): the unrestricted case

Cites Work

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

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