Balázs Montágh

  • Citations Per Year
Learn More
A natural generalization of graph Ramsey theory is the study of unavoidable subgraphs in large colored graphs. In this paper, we find a minimal family of unavoidable graphs in two-edgecolored graphs. Namely, for a positive even integer k, let Sk be the family of two-edge-colored graphs on k vertices such that one of the colors forms either two disjoint(More)
  • 1