"The minimum size of 3-graphs without a 4-set spanning no or exactly three ..."

Oleg Pikhurko (2011)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2011.03.006

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/Pikhurko11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/Pikhurko11
Oleg Pikhurko:
The minimum size of 3-graphs without a 4-set spanning no or exactly three edges. Eur. J. Comb. 32(7): 1142-1155 (2011)

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.