On the maximum number of qualitative independent partitions

DOI10.1016/0097-3165(89)90081-2MaRDI QIDQ1121889zbMATH OpenOpenAlexFDO

Authors Svatopluk Poljak, Zsolt Tuza

Publication date 1989

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(89)90081-2

zbMATH Keywords

independent partitions

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Other combinatorial set theory (03E05)

Recommendations

• Qualitatively almost-independent sets
• Qualitative independence and Sperner problems for directed graphs
• Separating Partition Systems and Locally Different Sequences
• A Sperner-type theorem and qualitative independence
• Partitions with certain intersection properties

Cites work

• scientific article; zbMATH DE number 3328173 (Why is no real title available?)
• scientific article; zbMATH DE number 4185671 (Why is no real title available?)
• An explicit construction of short monotone formulae for the monotone symmetric functions
• Explicit construction of exponential sized families of k-independent sets
• Families of \(k\)-independent sets
• On generalized graphs
• On qualitatively independent partitions and related problems
• Orthogonal partitions and covering of graphs
• Two applications (for search theory and truth functions) of Sperner type theorems

Cited in

(27)

• Optimal and near-optimal mixed covering arrays by column expansion
• Rényi 100, quantitative and qualitative (in)dependence
• Delta-systems and qualitative (in)dependence
• Sperner capacities
• On the extremal combinatorics of the Hamming space
• Merging covering arrays and compressing multiple sequence alignments
• \(m\)-qualitatively independent families
• Strong qualitative independence.
• Intersection number and capacities of graphs
• Graph-intersecting set systems and LYM inequalities
• scientific article; zbMATH DE number 1286223 (Why is no real title available?)
• Mixed-level covering, locating, and detecting arrays via cyclotomy
• Locating and detecting arrays for interaction faults
• On quorum systems for group resources allocation
• Upper bounds for covering arrays by tabu search.
• scientific article; zbMATH DE number 5713132 (Why is no real title available?)
• Qualitatively almost-independent sets
• On the state of strength-three covering arrays
• Set systems related to a house allocation problem
• How to guess two letters correctly
• Multiplicity-free permutation representations of the symmetric group.
• On the existence of independent partitions
• Capacities: From information theory to extremal set theory
• \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
• On the capacity of Boolean graph formulæ
• A Sperner-type theorem and qualitative independence
• Qualitative independence and Sperner problems for directed graphs

This page was built for publication: On the maximum number of qualitative independent partitions

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