"Solving a conjecture of Sedlacek: maximal edge sets in the 3-uniform ..."

Nigel Martin (1994)

> Home

Details and statistics

DOI: 10.1016/0012-365X(94)90168-6

access: open

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Martin94
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Martin94
Nigel Martin:
Solving a conjecture of Sedlacek: maximal edge sets in the 3-uniform sumset hypergraphs. Discret. Math. 125(1-3): 273-277 (1994)

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.