"A note on the computational complexity of weak saturation."

Martin Tancer, Mykhaylo Tyomkyn (2026)

> Home

Details and statistics

DOI: 10.1017/S0963548325100187

access: closed

type: Journal Article

metadata version: 2026-02-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/TancerT26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/TancerT26
Martin Tancer, Mykhaylo Tyomkyn:
A note on the computational complexity of weak saturation. Comb. Probab. Comput. 35(1): 83-88 (2026)

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.