English

A Hall-type theorem for triplet set systems based on medians in trees

Combinatorics 2009-06-24 v1

Abstract

Given a collection \C\C of subsets of a finite set XX, let \C=S\CS\bigcup \C = \cup_{S \in \C}S. Philip Hall's celebrated theorem \cite{hall} concerning `systems of distinct representatives' tells us that for any collection \C\C of subsets of XX there exists an injective (i.e. one-to-one) function f:\CXf: \C \to X with f(S)Sf(S) \in S for all S\CS \in \C if and and only if \C\C satisfies the property that for all non-empty subsets \C\C' of \C\C we have \C\C|\bigcup \C'| \geq |\C'|. Here we show that if the condition \C\C|\bigcup \C'| \geq |\C'| is replaced by the stronger condition \C\C+2|\bigcup \C'| \geq |\C'|+2, then we obtain a characterization of this condition for a collection of 3-element subsets of XX in terms of the existence of an injective function from \C\C to the vertices of a tree whose vertex set includes XX and that satisfies a certain median condition. We then describe an extension of this result to collections of arbitrary-cardinality subsets of XX.

Keywords

Cite

@article{arxiv.0906.4271,
  title  = {A Hall-type theorem for triplet set systems based on medians in trees},
  author = {Andreas Dress and Mike Steel},
  journal= {arXiv preprint arXiv:0906.4271},
  year   = {2009}
}

Comments

6 pages, no figures

R2 v1 2026-06-21T13:16:57.139Z