Sperner capacities
From MaRDI portal
Publication:2366215
DOI10.1007/BF01195325zbMath0771.05004OpenAlexW2911678896MaRDI QIDQ2366215
János Körner, Ugo Vaccaro, Luisa Gargano
Publication date: 29 June 1993
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01195325
Permutations, words, matrices (05A05) Communication, information (94A99) Graph theory (05C99) Other combinatorial set theory (03E05) Foundations of stochastic processes (60G05)
Related Items
Attribute-efficient learning of Boolean functions from Post closed classes, Different capacities of a digraph, Capacities: From information theory to extremal set theory, On the extremal combinatorics of the Hamming space, Intersection number and capacities of graphs, Binary covering arrays on tournaments, Rainbow Saturation and Graph Capacities, Locating and detecting arrays for interaction faults, Complexity of approximation of functions of few variables in high dimensions, Strong qualitative independence., Hardness results for covering arrays avoiding forbidden edges and error-locating arrays, Upper bounds for covering arrays by tabu search., Forbiddance and capacity, Connector families of graphs, Rényi 100, quantitative and qualitative (in)dependence, Asymptotic and constructive methods for covering perfect hash families and covering arrays, On the product dimension of clique factors, Unnamed Item, The Sperner capacity of linear and nonlinear codes for the cyclic triangle, Unnamed Item, Partial covering arrays: algorithms and asymptotics, Delta-systems and qualitative (in)dependence, Graph-intersecting set systems and LYM inequalities, On the capacity of Boolean graph formulæ, Connection between conjunctive capacity and structural properties of graphs, Information based complexity for high dimensional sparse functions, On clique coverings of complete multipartite graphs, Disjoint Spread Systems and Fault Location, On the general position problem on Kneser graphs, Covering arrays avoiding forbidden edges, Capacities of graphs and \(2\)-matchings, Upper Bounds on the Size of Covering Arrays, On the state of strength-three covering arrays
Cites Work
- On qualitatively independent partitions and related problems
- On the maximum number of qualitative independent partitions
- A Sperner-type theorem and qualitative independence
- On the ratio of optimal integral and fractional covers
- Two combinatorial covering theorems
- Two applications (for search theory and truth functions) of Sperner type theorems
- Orthogonal partitions and covering of graphs
- On the Shannon capacity of a graph
- Some remarks on strongly multiplicative systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
