Inviting an author to review:
Find an author and click ‘Invite to review selected article’ near their name.
Search for authorsSearch for similar articles
1
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Large Kr-free subgraphs in Ks-free graphs and some other Ramsey-type problems

      Random Structures and Algorithms
      Wiley-Blackwell

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references3

          • Record: found
          • Abstract: not found
          • Article: not found

          Constructive Bounds for a Ramsey-Type Problem

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The construction of certain graphs

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Ks-Free Graphs Without Large Kr-Free Subgraphs

                Bookmark

                Author and article information

                Journal
                Random Structures and Algorithms
                Random Struct. Alg.
                Wiley-Blackwell
                1042-9832
                1098-2418
                May 2005
                May 2005
                : 26
                : 3
                : 253-265
                Article
                10.1002/rsa.20035
                0c369fa3-e341-4ac1-9406-54457bca8b78
                © 2005

                http://doi.wiley.com/10.1002/tdm_license_1.1

                History

                Comments

                Comment on this article