Skip to main content
SpringerLink
Log in

3-uniform hypergraphs avoiding a given odd cycle

  • Original Paper
  • Published:
Combinatorica Aims and scope Submit manuscript

Abstract

We give upper bounds for the size of 3-uniform hypergraphs avoiding a given odd cycle using the definition of a cycle due to Berge. In particular, we show that a 3-uniform hypergraph containing no cycle of length 2k+1 has less than 4k 4 n 1+1/k+O(n) edges. Constructions show that these bounds are best possible (up to constant factor) for k=1,2,3, 5.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. B. Bollobás: Modern Graph Theory, Springer, 1998.

  2. B. Bollobás, E. Győri: Pentagons vs. triangles, Discrete Math. 308 (2008), 4332–4336.

    Article  MathSciNet  MATH  Google Scholar 

  3. J.A. Bondy and M. Simonovits: Cycles of even length in graphs, J. Combin. Theory B 16 (1974), 97–105.

    Article  MathSciNet  MATH  Google Scholar 

  4. P. Erdős and T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337–356.

    Article  MathSciNet  Google Scholar 

  5. P. Erdős and M. Simonovits: A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966), 51–57.

    MathSciNet  Google Scholar 

  6. P. Erdős and A.M. Stone: On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946), 1087–1091.

    Article  MathSciNet  Google Scholar 

  7. E. Győri: Triangle-free hypergraphs, Combinatorics, Probability and Computing 15 (2006), 185–191.

    Article  MathSciNet  Google Scholar 

  8. E. Győri and H. Li: A note on the number of triangles in C 2k+1-free graphs, submitted to J. Combin. Theory B.

  9. F. Lazebnik, J. Verstraëte: On hypergraphs of girth five, Electronic J. Combinatorics 10 (2003), 15 (Research Paper 25).

    Google Scholar 

  10. C. St. J. A. Nash-Williams: Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964), 12.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, H-1364, Hungary

    Ervin Győri

  2. Business School, Central European University, Budapest, H-1023, Hungary

    Nathan Lemons

Authors
  1. Ervin Győri
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nathan Lemons
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ervin Győri.

Additional information

Research partially supported by the Hungarian OTKA Grant AT 48826 and by ToK project FIST of Rényi Institute in the 6th Framework Program of the European Union.

Research partially supported by ToK project FIST of Rényi Institute in the 6th Framework Program of the European Union.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Győri, E., Lemons, N. 3-uniform hypergraphs avoiding a given odd cycle. Combinatorica 32, 187–203 (2012). https://doi.org/10.1007/s00493-012-2584-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00493-012-2584-4

Mathematics Subject Classification (2000)

Search

Navigation