- Record: found
- Abstract: found
- Article: found
Tripartite Version of the Corr\'adi-Hajnal Theorem
Preprint
2016-05-21
Read this article at
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 references3
- Record: found
- Abstract: not found
- Article: not found
Blow-up Lemma
J�nos Koml�s, G�bor S�rk�zy, Endre Szemer�di (1997)
- Record: found
- Abstract: not found
- Article: not found
On the maximal number of independent circuits in a graph
K. Corrádi, A Hajnal (1963)