Skip to main content
SpringerLink
Log in

Remarks on a paper by H. Bielak on size Ramsey numbers

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

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

References

  1. J. Beck, On size Ramsey number of pathes, trees, and circuits, I, J.Graph Theory 7 (1983), 115–129.

    MATH  MathSciNet  Google Scholar 

  2. J. Beck, On size Ramsey number of stars, trees, and circuits, II, Mathematics of Ramsey Theory (ed. by J. Nešetril and V. Rödl), Springer, Berlin, 1990, 34–45.

    Google Scholar 

  3. H. Bielak, Remarks on the size Ramsey numbers of graphs, Periodica Math.Hungar. 18 (1987), 27–38.

    Article  MATH  MathSciNet  Google Scholar 

  4. S. A. Burr, P. ErdŐos, R. J. Faudree, C. C. Rousseau and R. H. Schelp, Ramsey-minimal graphs for multiple copies, Indag.Math. 40 (1978), 187–195.

    MathSciNet  Google Scholar 

  5. P. ErdŐs and R. J. Faudree, Size Ramsey functions, Sets, graphs and numbers (Budapest, 1991), North-Holland, Amsterdam, 1992, 219–238.

    Google Scholar 

  6. P. ErdŐs, R. J. Faudree, C. C. Rousseau and R. H. Schelp, The size Ramsey number, Period.Math.Hung. 9 (1978), 145–161.

    Article  Google Scholar 

  7. P. ErdŐs and C. C. Rousseau, The size Ramsey number of a complete bipartite graph, Discrete Math. 113 (1993), 259–262.

    Article  MathSciNet  Google Scholar 

  8. R. J. Faudree, C. C. Rousseau and J. Sheehan, A class of size Ramsey problems involving stars, Graph Theory and Combinatorics, Proc.Conf.Hon.P.ErdŐs (Cambridge 1983) (ed. by B. Bollobas), Cambridge Univ. Press, 1984, 273–281.

  9. R. J. Faudree and J. Sheehan, Size Ramsey numbers involving stars, Discrete Math. 46 (1983), 151–157.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. E. Haxell and Y. Kohayakawa, The size-Ramsey number of trees, Israel J.Math. 89 (1995), 261–274.

    MATH  MathSciNet  Google Scholar 

  11. X. Ke, The size Ramsey number of trees with bounded degree, Random Struct.Algorithms 4 (1993), 85–97.

    MATH  MathSciNet  Google Scholar 

  12. R. Lortz and I. Mengersen, Size Ramsey results for paths versus stars, Australas.J.Comb. 18 (1998), 3–12.

    MATH  MathSciNet  Google Scholar 

  13. O. Pikhurko, Asymptotic size Ramsey results for bipartite graphs, SIAM J.Discr.Math. 16 (2003), 99–113.

    Article  MATH  Google Scholar 

  14. O. Pikhurko, Further asymptotic size Ramsey results obtained via linear programming, Discrete Math. 273 (2003), 193–202.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departement of Mathematical Sciences, Carnegie Mellon University, Pittsburgh, PA, 15213-3890, USA

    Oleg Pikhurko

Authors
  1. Oleg Pikhurko
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pikhurko, O. Remarks on a paper by H. Bielak on size Ramsey numbers. Periodica Mathematica Hungarica 47, 195–200 (2003). https://doi.org/10.1023/B:MAHU.0000010820.93968.2b

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:MAHU.0000010820.93968.2b

Search

Navigation