On the maximum number of qualitative independent partitions

DOI10.1016/0097-3165(89)90081-2zbMATH Open0675.05005OpenAlexW1970233409MaRDI QIDQ1121889FDOQ1121889

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

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

zbMATH Keywords

independent partitions

Mathematics Subject Classification ID

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

Cites Work

• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• On generalized graphs
• Explicit construction of exponential sized families of k-independent sets
• Title not available (Why is that?)
• On qualitatively independent partitions and related problems
• Title not available (Why is that?)
• Orthogonal partitions and covering of graphs
• An explicit construction of short monotone formulae for the monotone symmetric functions

Cited In (27)

• Rényi 100, quantitative and qualitative (in)dependence
• Optimal and near-optimal mixed covering arrays by column expansion
• 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
• Title not available (Why is that?)
• Graph-intersecting set systems and LYM inequalities
• Mixed-level covering, locating, and detecting arrays via cyclotomy
• Locating and detecting arrays for interaction faults
• On quorum systems for group resources allocation
• Title not available (Why is that?)
• Upper bounds for covering arrays by tabu search.
• 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
• On the capacity of Boolean graph formulæ
• \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays
• 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)