On qualitatively independent partitions and related problems

DOI10.1016/0166-218X(83)90072-0zbMath0515.05009OpenAlexW2047737764MaRDI 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 graphsexistence of orthogonal arraysintersection numbers of complete n-partite graphsset of mappingssystem of partitions of a set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of partitions of integers (05A17) Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Structural characterization of families of graphs (05C75)

Related Items (22)

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

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

This page was built for publication: On qualitatively independent partitions and related problems