4
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Tripartite Version of the Corr\'adi-Hajnal Theorem

      Preprint

      ,

      Read this article at

      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.

          Abstract

          Let \(G\) be a tripartite graph with \(N\) vertices in each vertex class. If each vertex is adjacent to at least \((2/3)N\) vertices in each of the other classes, then either \(G\) contains a subgraph that consists of \(N\) vertex-disjoint triangles or \(G\) is a specific graph in which each vertex is adjacent to exactly \((2/3)N\) vertices in each of the other classes.

          Related collections

          Most cited references 3

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

          Some Theorems on Abstract Graphs

           G. Dirac (1952)
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Blow-up Lemma

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

              On the maximal number of independent circuits in a graph

               K. Corrádi,  A Hajnal (1963)
                Bookmark

                Author and article information

                Journal
                2016-05-21
                Article
                10.1016/S0012-365X(01)00373-9
                1605.06647

                http://arxiv.org/licenses/nonexclusive-distrib/1.0/

                Custom metadata
                05C35, 05C70
                Discrete Math. 254 (2002), no. 1-3, 289--308
                22 pages, 4 figures
                math.CO

                Combinatorics

                Comments

                Comment on this article