<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05885811</id>
  <dt>j</dt>
  <an>05885811</an>
  <augroup>
    <au>Changat, Manoj</au>
    <au>Mathews, Joseph</au>
    <au>Peterin, Iztok</au>
    <au>Narasimha-Shenoi, Prasanth G.</au>
  </augroup>
  <ti>$n$-ary transit functions in graphs.</ti>
  <so>Discuss. Math., Graph Theory 30, No. 4, 671-685 (2010).</so>
  <py>2010</py>
  <pu>University of Zielona G\'ora Press, Zielona G\'ora</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>$n$-arity</ut>
    <ut>transit function</ut>
    <ut>betweenness</ut>
    <ut>Steiner convexity</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.7151/dmgt.1522</li>
  </ligroup>
  <abgroup>
    <ab>Summary: $n$-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural $n$-ary generalization of geodesical convexity. Furthermore, we generalize the betweenness axioms to $n$-ary transit functions and discuss the connectivity conditions for the underlying hypergraph. Also, an $n$-ary transit function for all paths is considered.</ab>
    <rv></rv>
  </abgroup>
</item>