"A proof of the upper matching conjecture for large graphs."

Ewan Davies, Matthew Jenssen, Will Perkins (2021)

> Home

Details and statistics

DOI: 10.1016/J.JCTB.2021.07.005

access: closed

type: Journal Article

metadata version: 2024-06-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jctb/DaviesJP21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jctb/DaviesJP21
Ewan Davies, Matthew Jenssen, Will Perkins:
A proof of the upper matching conjecture for large graphs. J. Comb. Theory B 151: 393-416 (2021)

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.