"An upper bound on the size of diamond-free families of sets."

Dániel Grósz, Abhishek Methuku, Casey Tompkins (2018)

> Home

Details and statistics

DOI: 10.1016/J.JCTA.2018.01.003

access: closed

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jct/GroszMT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/GroszMT18
Dániel Grósz, Abhishek Methuku, Casey Tompkins:
An upper bound on the size of diamond-free families of sets. J. Comb. Theory A 156: 164-194 (2018)

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.