New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help.

Published in: Random Struct. Algorithms (2000)

Keyphrases

lower bound
upper bound
tight bounds
worst case
website
significantly higher
vc dimension
lower levels
real time
decomposition methods
high levels
lower and upper bounds
error bounds
pairwise
expert systems
knowledge base
search engine