Across
- 3. A relation expressing sequence terms in terms of earlier terms — central to solving counting problems and generating functions.
- 6. A binary relation that is reflexive, antisymmetric and transitive(no space)
- 7. The set containing every subset of a given set; frequently used when counting substructures and proving combinatorial identities.
- 9. An algebraic structure in which every two elements have a greatest lower bound and least upper bound
- 10. The principle that forces at least two items into the same box when more pigeons than holes are available
Down
- 1. A walk that uses every edge exactly once but need not return to its start — existence depends on vertex degrees.
- 2. Name the 18th-century mathematician after whom the theorem relating subgroup orders to group orders is named
- 4. A formula that evaluates to true under every valuation
- 5. The operation that combines two functions (or relations) where the output of one becomes the input of the other; formalize with maps and domains.
- 8. Term that describes a tree (or other subgraph) that contains every vertex of the original graph.