3-dimensional matchings. (a) Input T. (b)–(c) Solutions. In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (also known as 2-dimensional matching) to 3-partite hypergraphs, which consist of hyperedges each of which contains 3 vertices (instead of edges containing 2 vertices in a usual graph). 3-dimensional matching, often abbreviated
![3-dimensional matching - Wikipedia](https://cdn-ak-scissors.b.st-hatena.com/image/square/2d371166dbe8adc2350a10b8e7f676f80ad98681/height=288;version=1;width=512/https%3A%2F%2Fupload.wikimedia.org%2Fwikipedia%2Fcommons%2Fthumb%2F5%2F50%2F3-dimensional-matching.svg%2F1200px-3-dimensional-matching.svg.png)