Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs.

Roy Oursler Andrzej Czygrinow

Published in: SIAM J. Discret. Math. (2019)

Keyphrases

spanning tree
random graphs
lower bound
upper bound
sufficient conditions
graph theoretic
worst case
graph matching
discrete geometry
minimum cost
graph structure
complementarity problems
real time
special case
graph theory
graph databases
structured data
graph representation
np hard
search engine
neural network