On qualitatively independent partitions and related problems

DOI10.1016/0166-218X(83)90072-0zbMath0515.05009MaRDI QIDQ1051639

Svatopluk Poljak, Vojtěch Rödl, Ales Pultr

Publication date: 1983

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(83)90072-0

zbMATH Keywords

dimension of Kneser graphs; existence of orthogonal arrays; intersection numbers of complete n-partite graphs; set of mappings; system of partitions of a set

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05A17: Combinatorial aspects of partitions of integers

05A05: Permutations, words, matrices

05B15: Orthogonal arrays, Latin squares, Room squares

05C75: Structural characterization of families of graphs

Related Items

The cut cone. III: On the role of triangle facets, The cut cone. III: On the role of triangle facets, Delta-systems and qualitative (in)dependence, Note on strong product graph dimension, Multiplicity-free permutation representations of the symmetric group., Constructions of new orthogonal arrays and covering arrays of strength three, Covering arrays of strength 3 and 4 from holey difference matrices, Merging covering arrays and compressing multiple sequence alignments, Explicit construction of exponential sized families of k-independent sets, On the maximum number of qualitative independent partitions, How to guess two letters correctly, Strong qualitative independence., Upper bounds for covering arrays by tabu search., On the capacity of Boolean graph formulæ, On the extremal combinatorics of the Hamming space, Intersection number and capacities of graphs, Rényi 100, quantitative and qualitative (in)dependence, Sperner capacities, On quorum systems for group resources allocation, Locating and detecting arrays for interaction faults, Generalized covering designs and clique coverings, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• On the ratio of optimal integral and fractional covers
• Parallel concepts in graph theory
• Two applications (for search theory and truth functions) of Sperner type theorems
• Families of \(k\)-independent sets
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Orthogonal partitions and covering of graphs
• Indépendance d'ensembles et prolongement de mesures (Résultats et problèmes)
• Orthogonal Arrays of Strength two and three
• THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS