<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445358769</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317142908.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20110301xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00493-011-2621-8</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00493-011-2621-8</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="0">
   <subfield code="a">Hereditary quasirandom properties of hypergraphs</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Domingos Dellamonica Jr., Vojtěch Rödl]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">Thomason and Chung, Graham and Wilson were the first to systematically investigate properties of quasirandom graphs. They have stated several quite disparate graph properties — such as having uniform edge distribution or containing a prescribed number of certain subgraphs — and proved that these properties are equivalent in a deterministic sense. Simonovits and Sós introduced a hereditary property (which we call S) stating the following: for a small fixed graph L, a graph G on n vertices is said to have the property S if for every set X ⊆ V(G), the number of labeled copies of L in G[X] (the subgraph of G induced by the vertices of X) is given by 2−e(L)|X| υ(L) + o(n υ(L)). They have shown that S is equivalent to the other quasirandom properties. In this paper we give a natural extension of the result of Simonovits and Sós to k-uniform hypergraphs, answering a question of Conlon et al. Our approach also yields an alternative, and perhaps simpler, proof of one of their theorems.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">János Bolyai Mathematical Society and Springer Verlag, 2011</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Dellamonica Jr.</subfield>
   <subfield code="D">Domingos</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Emory University, 400 Dowman Dr., W401, 30322, Atlanta, GA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Rödl</subfield>
   <subfield code="D">Vojtěch</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Emory University, 400 Dowman Dr., W401, 30322, Atlanta, GA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Combinatorica</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">31/2(2011-03-01), 165-182</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:2&lt;165</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-2621-8</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-2621-8</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">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Dellamonica Jr</subfield>
   <subfield code="D">Domingos</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Emory University, 400 Dowman Dr., W401, 30322, Atlanta, GA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Rödl</subfield>
   <subfield code="D">Vojtěch</subfield>
   <subfield code="u">Department of Mathematics and Computer Science, Emory University, 400 Dowman Dr., W401, 30322, Atlanta, GA, 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/2(2011-03-01), 165-182</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:2&lt;165</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>
