Back to Results
First PageMeta Content
Mathematics / Jensen hierarchy / Ternary tree / Binary trees / Operator theory


BINARY SUBTREES WITH FEW LABELED PATHS RODNEY G. DOWNEY, NOAM GREENBERG, CARL G. JOCKUSCH, JR., AND KEVIN G. MILANS Abstract. We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-la
Add to Reading List

Document Date: 2011-07-08 08:35:11

Open Document

File Size: 500,02 KB

Share Result on Facebook
UPDATE