"A Sharp Bound for the Number of Sets that Pairwise Intersect at k ..."

Hunter S. Snevily (2003)

> Home

Details and statistics

DOI: 10.1007/S00493-003-0031-2

access: closed

type: Journal Article

metadata version: 2020-07-22

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/combinatorica/Snevily03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/combinatorica/Snevily03
Hunter S. Snevily:
A Sharp Bound for the Number of Sets that Pairwise Intersect at k Positive Values. Comb. 23(3): 527-533 (2003)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.