Login / Signup

Perfect matchings in large uniform hypergraphs with large minimum collective degree.

Vojtech RödlAndrzej RucinskiEndre Szemerédi
Published in: J. Comb. Theory, Ser. A (2009)
Keyphrases
  • square error
  • real time
  • hidden markov models
  • graph theory
  • database
  • databases
  • decision making
  • web pages
  • case study
  • xml documents
  • spanning tree
  • collective intelligence
  • global minimum