query: Regarding self complementary trees if such exist.
positive_passages.docid: 142809
positive_passages.text: Trees whose complement is also a tree
negative_passages.docid: 60223
negative_passages.text: Two principal ideals coincide if and only if their generators are associated
negative_passages.docid: 98559
negative_passages.text: subtlety of self-defined function and its evaluation
negative_passages.docid: 118189
negative_passages.text: Proving the pairing axiom from the rest of ZF
negative_passages.docid: 33117
negative_passages.text: Cyclic containment of sets
negative_passages.docid: 139514
negative_passages.text: Can we construct $\Bbb C$ without first identifying $\Bbb R$?
negative_passages.docid: 148376
negative_passages.text: Proving that a Binary Tree of $n$ nodes has a height of at least $\log(n)$.
negative_passages.docid: 43504
negative_passages.text: Proving the existence of a complement subspace $U' \subset V$.
negative_passages.docid: 28580
negative_passages.text: Is there a module for balanced binary tree in Python's standard library?
negative_passages.docid: 21459
negative_passages.text: Orthogonal complement examples
negative_passages.docid: 95928
negative_passages.text: Independence and orthogonality
negative_passages.docid: 88050
negative_passages.text: Desirable S-box properties
negative_passages.docid: 96620
negative_passages.text: Condition on degrees for existence of a tree
negative_passages.docid: 57398
negative_passages.text: Where does TREE(n) sit on the Fast Growing Hierarchy?
negative_passages.docid: 117479
negative_passages.text: Mutual set of representatives for left and right cosets: what about infinite groups?
negative_passages.docid: 141299
negative_passages.text: Alternative set theories
negative_passages.docid: 49045
negative_passages.text: Graph theory: Tree holds two sub-tree with an amount of vertices