Copyright © Philip M. Parker, INSEAD. Terms of Use.
| Domain | Definition |
Math | (1) A perfect matching between vertices of a bipartite graph, that is, a subgraph which pairs every vertex with exactly one other vertex. (2) The problem of finding such a matching. (references) |
Source: compiled by the editor from various references; see credits. | |
Scrabble® Enable2K-Verified Anagrams | |
| Words within the letters "a-a-b-c-e-g-h-i-i-i-m-n-p-r-t-t-t" | |
-4 letters: arithmetician. | |
-5 letters: antipathetic. | |
| Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro. | |
Hexadecimal (or equivalents, 770AD-1900s) (references)42 49 50 41 52 54 49 54 45 4D 41 54 43 48 49 4E 47 |
| Leonardo da Vinci (1452-1519; backwards) (references)
|
Binary Code (1918-1938, probably earlier) (references)01000010 01001001 01010000 01000001 01010010 01010100 01001001 01010100 01000101 00100000 01001101 01000001 01010100 01000011 01001000 01001001 01001110 01000111 |
HTML Code (1990) (references)B I P A R T I T E   M A T C H I N G |
ISO 10646 (1991-1993) (references)0042 0049 0050 0041 0052 0054 0049 0054 0045 004D 0041 0054 0043 0048 0049 004E 0047 |
Encryption (beginner's substitution cypher): (references)36435035525443543924735543742434841 |
| 1. Anagrams 2. Orthography 3. Bibliography |
Copyright © Philip M. Parker, INSEAD. Terms of Use.
