Similarity relations on finite ordered sets

DOI10.1016/0097-3165(77)90082-6zbMath0366.06001OpenAlexW2047340423MaRDI QIDQ1241759

Douglas G. Rogers

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(77)90082-6

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Total orders (06A05)

Related Items (3)

Pascal triangles, Catalan numbers and renewal arrays ⋮ Catalan, Motzkin, and Riordan numbers ⋮ Dyck path enumeration

Cites Work

• Unnamed Item
• Unnamed Item
• A Catalan triangle
• Extrapolation when very little is known about the source
• Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
• Motzkin numbers

This page was built for publication: Similarity relations on finite ordered sets