On the number of congruence classes of paths
From MaRDI portal
Publication:409484
Abstract: Let denote the undirected path of length . The cardinality of the set of congruence classes induced by the graph homomorphisms from onto is determined. This settles an open problem of Michels and Knauer (Disc. Math., 309 (2009) 5352-5359). Our result is based on a new proven formula of the number of homomorphisms between paths.
Recommendations
Cites work
Cited in
(9)- On congruences of paths
- Graph homomorphisms between trees
- The number of path homomorphisms by the generalized Catalan number
- The congruence classes of paths and cycles
- COUNTING FUNDAMENTAL PATHS IN CERTAIN GARSIDE SEMIGROUPS
- Congruence relations of paths: some combinatorial properties
- A note on counting homomorphisms of paths
- The number of graph homomorphisms between paths and cycles with loops, a problem from Stanley's enumerative combinatorics
- Congruences modulo powers of 2 for the number of unique path partitions
This page was built for publication: On the number of congruence classes of paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409484)