<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>02165074</id>
  <dt>j</dt>
  <an>02165074</an>
  <augroup>
    <au>Kostochka, Alexandr</au>
    <au>Verstra\"ete, Jacques</au>
  </augroup>
  <ti>Even cycles in hypergraphs.</ti>
  <so>J. Comb. Theory, Ser. B 94, No. 1, 173-182 (2005).</so>
  <py>2005</py>
  <pu>Elsevier Science (Academic Press), San Diego, CA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>hypertree</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1016/j.jctb.2004.12.004</li>
  </ligroup>
  <abgroup>
    <ab>This paper determines the possible maximum number of (not necessarily distinct) edges in an $n$-vertices hypergraph without even cycles.</ab>
    <rv>P\'eter L. Erd\H os (Budapest)</rv>
  </abgroup>
</item>