Cone dependence -- a basic combinatorial concept

DOI10.1023/A:1024183804420MaRDI QIDQ1404310zbMATH OpenOpenAlexWikidataFDO

Authors Levon H. Khachatrian, Rudolf Ahlswede

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 sequence[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tur%EF%BF%BD%EF%BF%BDn+problem&go=Go Tur��n problem]combinatorial extremal problemspositive linear combinations

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1264586
• scientific article; zbMATH DE number 6789270
• scientific article; zbMATH DE number 1846855
• Combinatorial identities for polyhedral cones
• Combinatorial convexity
• Combinatorial properties of dependence graphs
• The cone condition and \(t\)-designs
• Combinatorics and geometry of Littlewood-Richardson cones
• Cone Inclusion Numbers
• Convexity in combinatorial structures

Cited in

(3)

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

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

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