Hostname: page-component-cb9f654ff-9b74x Total loading time: 0 Render date: 2025-08-24T21:14:07.435Z Has data issue: false hasContentIssue false
  • English
  • Français

Mappings of finite sets

Published online by Cambridge University Press:  26 February 2010

P. D. T. A. Elliott
P. D. T. A. Elliott
Affiliation:
Trinity College, Cambridge.

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Let A = {a1, …, an} and B={b1, …, bn} be two sets of n elements, and let R be a set of ordered pairs (ai, bi), or in other words a relation defined on A × B. By a map between A and B under R we mean a one-to-one correspondence between A and B such that if bi, corresponds to ai then (ai, bj) is one of the pairs in R.

Information

Type
Research Article
Information
Mathematika , Volume 13 , Issue 1 , June 1966 , pp. 23 - 25
Copyright
Copyright © University College London 1966

References

† “Coprime mappings between sets of consecutive integers”, Mathematika, 10 (1963), 132–136.CrossRefGoogle Scholar

page24 note02 † Znám, Š., “On a combinational problem of K. Zarankiewicz”, Colloquium Mathematicum, 11 (1963), 81–84.CrossRefGoogle Scholar