Cone dependence -- a basic combinatorial concept

DOI10.1023/A:1024183804420zbMath1019.05061OpenAlexW1533292529WikidataQ105584640 ScholiaQ105584640MaRDI QIDQ1404310

Levon H. Khachatrian

Publication date: 21 August 2003

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1024183804420

zbMATH Keywords

binary sequenceTurán problemcombinatorial extremal problemspositive linear combinations

Mathematics Subject Classification ID

Extremal set theory (05D05) Other designs, configurations (05B30) Discrete geometry (52C99)

Related Items (3)

A remark on the problem of nonnegative \(k\)-subset sums ⋮ Minimum number of edges in a hypergraph guaranteeing a perfect fractional matching and the MMS conjecture ⋮ Fractional matchings in hypergraphs

This page was built for publication: Cone dependence -- a basic combinatorial concept