Pages that link to "Item:Q1894014"
From MaRDI portal
The following pages link to On the extremal combinatorics of the Hamming space (Q1894014):
Displayed 24 items.
- \((2,1)\)-separating systems beyond the probabilistic bound (Q375844) (← links)
- A geometric proof of the gap theorem (Q1268611) (← links)
- Tiling Hamming space with few spheres (Q1374207) (← links)
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures (Q1569877) (← links)
- On general position sets in Cartesian products (Q2041227) (← links)
- The edge general position problem (Q2091137) (← links)
- The general position achievement game played on graphs (Q2142694) (← links)
- Generalization of IPP codes and IPP set systems (Q2190902) (← links)
- A Steiner general position problem in graph theory (Q2245772) (← links)
- Codes for copyright protection: the case of two pirates (Q2388220) (← links)
- The general position number of integer lattices (Q2660838) (← links)
- 2-Cancellative Hypergraphs and Codes (Q2883859) (← links)
- Too Acute to Be True: The Story of Acute Sets (Q4972078) (← links)
- THE GENERAL POSITION NUMBER OF THE CARTESIAN PRODUCT OF TWO TREES (Q4999610) (← links)
- General d-position sets (Q5013341) (← links)
- Separation and Witnesses (Q5322994) (← links)
- Delta-systems and qualitative (in)dependence (Q5917474) (← links)
- General position sets in two families of Cartesian product graphs (Q6040049) (← links)
- Near-sunflowers and focal families (Q6076184) (← links)
- TRAVERSING A GRAPH IN GENERAL POSITION (Q6090185) (← links)
- Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products (Q6090820) (← links)
- Edge general position sets in Fibonacci and Lucas cubes (Q6111323) (← links)
- Extremal edge general position sets in some graphs (Q6131296) (← links)
- The general position avoidance game and hardness of general position games (Q6150675) (← links)