On the extremal combinatorics of the Hamming space
From MaRDI portal
Publication:1894014
DOI10.1016/0097-3165(95)90019-5zbMath0826.05054OpenAlexW2017050610MaRDI QIDQ1894014
Publication date: 26 November 1995
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(95)90019-5
extremal set theoryextremal combinatoricstriangle inequalityHamming spacegeneral positionqualitative independence(1,2)-separation
Related Items (24)
2-Cancellative Hypergraphs and Codes ⋮ The general position achievement game played on graphs ⋮ Codes for copyright protection: the case of two pirates ⋮ Separation and Witnesses ⋮ Tiling Hamming space with few spheres ⋮ The general position number of integer lattices ⋮ \((2,1)\)-separating systems beyond the probabilistic bound ⋮ General position sets in two families of Cartesian product graphs ⋮ Near-sunflowers and focal families ⋮ Generalization of IPP codes and IPP set systems ⋮ TRAVERSING A GRAPH IN GENERAL POSITION ⋮ Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products ⋮ Edge general position sets in Fibonacci and Lucas cubes ⋮ Extremal edge general position sets in some graphs ⋮ The general position avoidance game and hardness of general position games ⋮ A Steiner general position problem in graph theory ⋮ Delta-systems and qualitative (in)dependence ⋮ On general position sets in Cartesian products ⋮ Too Acute to Be True: The Story of Acute Sets ⋮ A geometric proof of the gap theorem ⋮ Secure frameproof codes, key distribution patterns, group testing algorithms and related structures ⋮ THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES ⋮ The edge general position problem ⋮ General d-position sets
Cites Work
- On restricted colourings of \(K_ n\)
- Union-free hypergraphs and probability theory
- On qualitatively independent partitions and related problems
- Families of finite sets in which no set is covered by the union of \(r\) others
- Coloring graphs with locally few colors
- How robust is the n-cube?
- On the maximum number of qualitative independent partitions
- New bounds for perfect hashing via information theory
- Families of finite sets in which no set is covered by the union of two others
- A Sperner-type theorem and qualitative independence
- Qualitative independence and Sperner problems for directed graphs
- Subcube fault-tolerance in hypercubes
- Combinatorial properties of systems of sets
- On the upper bound of the size of the \(r\)-cover-free families
- Capacities: From information theory to extremal set theory
- Extremal problems for finite sets and convex hulls---a survey
- A density version of the Hales-Jewett theorem
- Intersection number and capacities of graphs
- Sperner capacities
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Separating Partition Systems and Locally Different Sequences
- Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
- Fredman–Komlós bounds and information theory
- Vector sets for exhaustive testing of logic circuits
- Orthogonal partitions and covering of graphs
- Locality in Distributed Graph Algorithms
- On sets of integers containing k elements in arithmetic progression
- New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
- Covering arrays and intersecting codes
- Compressing inconsistent data
- Locality based graph coloring
- Nonrandom binary superimposed codes
- Optimal numberings and isoperimetric problems on graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the extremal combinatorics of the Hamming space
