"The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle."

Edward Marchant (2013)

> Home

Details and statistics

DOI: 10.1017/S0963548312000430

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/cpc/Marchant13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/Marchant13
Edward Marchant:
The Largest Minimum Codegree of a 3-Graph Without a Generalized 4-Cycle. Comb. Probab. Comput. 22(1): 112-117 (2013)

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.