Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture.

Nathan J. Bowler Yared Nigussie

Published in: J. Comb. Theory, Ser. B (2024)

Keyphrases

mining frequent
tree mining
unordered trees
rooted trees
labeled trees
partial order
tree matching
frequent subtrees
frequent patterns
partially ordered
statistical tests
theorem proving
finite automata
complete axiomatization
tree nodes
tree structured data
tree structures
theorem prover