Tiling a -board with squares and dominoes.
Tilings by translation: enumeration by a rational language approach.
Tolerante Catalanzahlen
Tournament sequences and Meeussen sequences.
Towards a human proof of Gessel's conjecture.
Towards the distribution of the size of a largest planar matching and largest planar subgraph in random bipartite graphs.
Transitivity and partial order
In this paper we find a one-to-one correspondence between transitive relations and partial orders. On the basis of this correspondence we deduce the recurrence formula for enumeration of their numbers. We also determine the number of all transitive relations on an arbitrary -element set up to .
Trees and meta-Fibonacci sequences.
Two analogues of a classical sequence.
Two involutions for signed excedance numbers.
Two new criteria for comparison in the Bruhat order.
Two statistics linking Dyck paths and non-crossing partitions.
Two-stage allocations and the double -function.