On Hypergraphs of Girth Five

@article{Lazebnik2003OnHO,
  title={On Hypergraphs of Girth Five},
  author={Felix Lazebnik and Jacques Verstra{\"e}te},
  journal={Electr. J. Comb.},
  year={2003},
  volume={10}
}
In this paper, we study r-uniform hypergraphs H without cycles of length less than five, employing the definition of a hypergraph cycle due to Berge. In particular, for r = 3, we show that if H has n vertices and a maximum number of edges, then |H| = 1 6 n + o(n). This also asymptotically determines the generalized Turán number T3(n, 8, 4). Some results are based on our bounds for the maximum size of Sidon-type sets in Zn. 1 Definitions In this paper, a hypergraph H is a family of distinct… CONTINUE READING
22 Citations
30 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

On the difference between consecutive primes

  • M. Huxley
  • Invent. Math
  • 1972
Highly Influential
2 Excerpts

Hypergraphs, in Selected Topics in Graph Theory 3, edited by Lowell W

  • C. Berge
  • Beineke and Robin.J. Wilson, Academic Press…
  • 1998
2 Excerpts

Hypergraphs, Handbook of Combinatorics, Volume 1, North–Holland

  • P. Duchet
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…