Hypergraphic Degree Sequences are Hard Academic Article uri icon

  •  
  • Overview
  •  
  • Research
  •  
  • View All
  •  

abstract

  • We show that deciding if a given vector is the degree sequence of a 3-hypergraph is NP-complete.