ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

Bounding one-way differences (1987)

Frankl, P. ; Füredi, Z. ; Pach, J.

Springer

Graphs and combinatorics 3 (1987), S. 341-347

add to mindlist on the mindlist

Details

ISSN: 1435-5914

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract Letf(n, k) denote the maximum length of a sequence (F 1,F 2,...) of distinct subsets of ann-element set with the property that|F i ∖F j | 〈 k for alli 〈 j. We determine the exact values off(n, 2) and characterize all the extremal sequences. Fork ≥ 3 we prove that $$f(n,k) = (1 + o(1))\left( {\begin{array}{*{20}c} n \\ k \\ \end{array} } \right)$$ . Some related problems are also considered.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01788556

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit