Search for authorsSearch for similar articles
6
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Short Proofs of Some Extremal Results

      , ,
      Combinatorics, Probability and Computing
      Cambridge University Press (CUP)

      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 references33

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

          Inverse Littlewood–Offord theorems and the condition number of random discrete matrices

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

            Optimal inverse Littlewood–Offord theorems

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

              Problems and results in extremal combinatorics—I

              Noga Alon (2003)
                Bookmark

                Author and article information

                Journal
                applab
                Combinatorics, Probability and Computing
                Combinator. Probab. Comp.
                Cambridge University Press (CUP)
                0963-5483
                1469-2163
                January 2014
                November 4 2013
                January 2014
                : 23
                : 01
                : 8-28
                Article
                10.1017/S0963548313000448
                1d477512-c469-4fc5-a7a7-027cf244bc57
                © 2014
                History

                Comments

                Comment on this article