"On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected ..."

Qinglin Wang, Yingzhi Tian, Lihua Feng (2022)

> Home

Details and statistics

DOI: 10.1142/S0219265921420202

access: closed

type: Journal Article

metadata version: 2022-05-18

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/join/WangTF22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/join/WangTF22
Qinglin Wang, Yingzhi Tian, Lihua Feng:
On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected Hypersubgraphs. J. Interconnect. Networks 22(1): 2142020:1-2142020:7 (2022)

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.