"The complexity of perfect matchings and packings in dense hypergraphs."

Jie Han, Andrew Treglown (2020)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2019.06.004

access: open

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jct/HanT20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/HanT20
Jie Han, Andrew Treglown:
The complexity of perfect matchings and packings in dense hypergraphs. J. Comb. Theory B 141: 72-104 (2020)

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.