<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445358629</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142908.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110501xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00493-011-2665-9</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00493-011-2665-9</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Engström</subfield>
   <subfield code="D">Alexander</subfield>
   <subfield code="u">Department of Mathematics, University of California, 94720, Berkeley, CA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="2">
   <subfield code="a">A local criterion for Tverberg graphs</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Alexander Engström]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">The topological Tverberg theorem states that for any prime power q and continuous map from a (d+1)(q−1)-simplex to ℝ d , there are q disjoint faces F i of the simplex whose images intersect. It is possible to put conditions on which pairs of vertices of the simplex that are allowed to be in the same face F i . A graph with the same vertex set as the simplex, and with two vertices adjacent if they should not be in the same F i , is called a Tverberg graph if the topological Tverberg theorem still work. These graphs have been studied by Hell, Schöneborn and Ziegler, and it is known that disjoint unions of small paths, cycles, and complete graphs are Tverberg graphs. We find many new examples by establishing a local criterion for a graph to be Tverberg. An easily stated corollary of our main theorem is that if the maximal degree of a graph is D, and D(D+1)&lt;q, then it is a Tverberg graph. We state the affine versions of our results and also describe how they can be used to enumerate Tverberg partitions.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">János Bolyai Mathematical Society and Springer Verlag, 2011</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Combinatorica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">31/3(2011-05-01), 321-332</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:3&lt;321</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">493</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00493-011-2665-9</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00493-011-2665-9</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Engström</subfield>
   <subfield code="D">Alexander</subfield>
   <subfield code="u">Department of Mathematics, University of California, 94720, Berkeley, CA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Combinatorica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">31/3(2011-05-01), 321-332</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:3&lt;321</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">31</subfield>
   <subfield code="o">493</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
