Name
Abstract | ||
|---|---|---|
A set U of functions from [ k ] to [ n ] is said to be (m, n, k)-guessing (where m , n , k are natural numbers and 2 ⩽ m ⩽ k ) if for every function w from a subset of size m of [ k ] into [ n ] there exists a function in U coinciding with w in at least two places. Let g ( m , n , k ) denote the minimal size of an (m, n, k) -guessing set. We investigate the behavior of g ( m , n , k ), with special attention to the case m = k . |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0097-3165(92)90049-Z | J. Comb. Theory, Ser. A |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Natural number,Partition (number theory),Mathematics,Alphabet | Journal | 61 |
Issue | ISSN | Citations |
1 | Journal of Combinatorial Theory, Series A | 0 |
PageRank | References | Authors |
0.34 | 3 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ron Aharoni | 1 | 380 | 66.56 |
| Ron Holzman | 2 | 287 | 43.78 |