"Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs."

Michael Krivelevich, Ram Nathaniel, Benny Sudakov (2001)

> Home

Details and statistics

DOI: 10.1006/JAGM.2001.1173

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/KrivelevichNS01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/KrivelevichNS01
Michael Krivelevich, Ram Nathaniel, Benny Sudakov:
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs. J. Algorithms 41(1): 99-113 (2001)

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.