<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445358742</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-2610-y</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00493-011-2610-y</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="4">
   <subfield code="a">The number of K m,m -free graphs</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[József Balogh, Wojciech Samotij]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">A graph is called H-free if it contains no copy of H. Denote by f n (H) the number of (labeled) H-free graphs on n vertices. Erdős conjectured that f n (H) ≤ 2(1+o(1))ex(n,H). This was first shown to be true for cliques; then, Erdős, Frankl, and Rödl proved it for all graphs H with χ(H)≥3. For most bipartite H, the question is still wide open, and even the correct order of magnitude of log2 f n (H) is not known. We prove that f n (K m,m ) ≤ 2 O (n 2−1/m ) for every m, extending the result of Kleitman and Winston and answering a question of Erdős. This bound is asymptotically sharp for m∈{2,3}, and possibly for all other values of m, for which the order of ex(n,K m,m ) is conjectured to be Θ(n 2−1/m ). Our method also yields a bound on the number of K m,m -free graphs with fixed order and size, extending the result of Füredi. Using this bound, we prove a relaxed version of a conjecture due to Haxell, Kohayakawa, and Łuczak and show that almost all K 3,3-free graphs of order n have more than 1/20·ex(n,K 3,3) edges.</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">Balogh</subfield>
   <subfield code="D">József</subfield>
   <subfield code="u">Department of Mathematics, University of California, San Diego 9500 Gilman Drive, 92093, La Jolla, CA, USA</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Samotij</subfield>
   <subfield code="D">Wojciech</subfield>
   <subfield code="u">Department of Mathematics, University of Illinois, 61801, Urbana, IL, 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), 131-150</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:2&lt;131</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-2610-y</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-2610-y</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">Balogh</subfield>
   <subfield code="D">József</subfield>
   <subfield code="u">Department of Mathematics, University of California, San Diego 9500 Gilman Drive, 92093, La Jolla, CA, 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">Samotij</subfield>
   <subfield code="D">Wojciech</subfield>
   <subfield code="u">Department of Mathematics, University of Illinois, 61801, Urbana, IL, 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), 131-150</subfield>
   <subfield code="x">0209-9683</subfield>
   <subfield code="q">31:2&lt;131</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>
