Answers are grounded in this paper and cite their sources.
An ordered r-matching of size n is an r-uniform hypergraph on a linearly ordered set of vertices, consisting of n pairwise disjoint edges. Two ordered r-matchings are isomorphic if there is an order-preserving isomorphism between them. A pair of twins in an ordered r-matching is formed by two vertex disjoint isomorphic sub-matchings. Let t (r) (n) denote the maximum size of twins one may find in every ordered r-matching of size n.
No takes yet. Share an insight, caveat, or question.
Dudek et al. (2024) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: