Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
Sam and Andrew Snowden
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
An explicit relation is derived between hairy graph homologies for cyclic operads coming from operads, via functors relating twisted walled and unwalled Brauer categories.
citing papers explorer
-
The Finite Length Property of the Rado Graph and Friends
Generalizes the finite length property to structures with few-orbit finite approximations (char 0) and to Fraïssé limits with free amalgamation in unary/binary vocabularies, including the Rado graph.
-
Relating Brauer categories, Koszul complexes, and graph complexes
An explicit relation is derived between hairy graph homologies for cyclic operads coming from operads, via functors relating twisted walled and unwalled Brauer categories.