Families of \(k\)-independent sets

DOI10.1016/0012-365X(73)90098-8zbMath0269.05002MaRDI QIDQ2563162

Publication date: 1973

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

Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Permutations, words, matrices (05A05) Other combinatorial set theory (03E05)

Related Items (81)

Non-uniform covering array with symmetric forbidden edge constraints ⋮ Attribute-efficient learning of Boolean functions from Post closed classes ⋮ The cell probe complexity of succinct data structures ⋮ The maximum number of balancing sets ⋮ On the extremal combinatorics of the Hamming space ⋮ Construction of non-isomorphic covering arrays ⋮ Exact learning from an honest teacher that answers membership queries ⋮ Secure overlay network design ⋮ Deterministic constructions of high-dimensional sets with small dispersion ⋮ Binary covering arrays on tournaments ⋮ How robust is the n-cube? ⋮ Suitable Permutations, Binary Covering Arrays, and Paley Matrices ⋮ Further results on the covering radius of small codes ⋮ Exact learning of juntas from membership queries ⋮ On the maximum number of qualitative independent partitions ⋮ Covering arrays from \(m\)-sequences and character sums ⋮ Covering arrays on product graphs ⋮ Chromatic numbers of copoint graphs of convex geometries ⋮ An Erdős-Ko-Rado theorem for the derangement graph of PGL(\(2,q\)) acting on the projective line ⋮ Ordered covering arrays and upper bounds on covering codes ⋮ Augmentation of covering arrays of strength two ⋮ Constructing new covering arrays from LFSR sequences over finite fields ⋮ Locating and detecting arrays for interaction faults ⋮ A greedy-metaheuristic 3-stage approach to construct covering arrays ⋮ Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods ⋮ Complexity of approximation of functions of few variables in high dimensions ⋮ New optimal covering arrays using an orderly algorithm ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Algebraic Modelling of Covering Arrays ⋮ Forbidden configurations and repeated induction ⋮ Incoherent majorities: the McGarvey problem in judgement aggregation ⋮ Structures and lower bounds for binary covering arrays ⋮ Applications of coding theory to communication combinatorial problems ⋮ Strong qualitative independence. ⋮ A polynomial algorithm for constructing families of k-independent sets ⋮ Sperner families satisfying additional conditions and their convex hulls ⋮ Coloring chains for compression with uncertain priors ⋮ Rényi 100, quantitative and qualitative (in)dependence ⋮ Orientations making \(k\)-cycles cyclic ⋮ Unnamed Item ⋮ How to guess two letters correctly ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ Application of coding theory to interconnection networks ⋮ Classification of orthogonal arrays by integer programming ⋮ On the minimum number of completely 3-scrambling permutations ⋮ Exhaustive testing of almost all devices with outputs depending on limited number of inputs ⋮ Vertex Turán problems in the hypercube ⋮ Randomized post-optimization of covering arrays ⋮ Covering arrays from cyclotomy ⋮ New covering array numbers ⋮ Consecutive covering arrays and a new randomness test ⋮ Covering and radius-covering arrays: constructions and classification ⋮ Partial covering arrays: algorithms and asymptotics ⋮ Delta-systems and qualitative (in)dependence ⋮ Graph-intersecting set systems and LYM inequalities ⋮ Optimal and near-optimal mixed covering arrays by column expansion ⋮ The \(k\)-distinct language: parameterized automata constructions ⋮ Lower bounds on covering codes via partition matrices ⋮ The covering radius of extreme binary 2-surjective codes ⋮ On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) ⋮ On the capacity of Boolean graph formulæ ⋮ Covering arrays: using prior information for construction, evaluation and to facilitate fault localization ⋮ Arrays for combinatorial interaction testing: a review on constructive approaches ⋮ t-Covering Arrays: Upper Bounds and Poisson Approximations ⋮ Merging covering arrays and compressing multiple sequence alignments ⋮ Perfect sets of paths in the full graph of SDN switches ⋮ Disjoint Spread Systems and Fault Location ⋮ Cover starters for covering arrays of strength two ⋮ Coding for write-unidirectional memories and conflict resolution ⋮ Non-adaptive Learning of a Hidden Hypergraph ⋮ \(m\)-qualitatively independent families ⋮ Covering arrays on graphs ⋮ Problems and algorithms for covering arrays via set covers ⋮ A survey on the problems and algorithms for covering arrays via set covers ⋮ On qualitatively independent partitions and related problems ⋮ MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays ⋮ Upper Bounds on the Size of Covering Arrays ⋮ Explicit construction of exponential sized families of k-independent sets ⋮ Coloring graphs with locally few colors ⋮ Binary consecutive covering arrays

Cites Work

This page was built for publication: Families of \(k\)-independent sets