The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph.

Oliver Cooley Richard Mycroft

Published in: Discret. Math. (2017)

Keyphrases

vertex set
upper bound
lower bound
worst case
pairwise
higher order
database
genetic algorithm
information systems
np hard
random walk
directed graph
minimum cost