z-logo
Premium
The Number of values of Combinatorial Functions
Author(s) -
Ahlswede Rudolf,
Daykin David E.
Publication year - 1979
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/blms/11.1.49
Subject(s) - mathematics , citation , combinatorics , reading (process) , discrete mathematics , arithmetic , library science , computer science , law , political science
The form of this theorem led us to conjecture that m sets can be partitioned into & and X having m — 1 differences S \ T with S e S , T eX. Given an ordered sequence Su ..., Sm of sets letd be the number of differences

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here