| Display title | Gallai–Edmonds decomposition |
| Default sort key | Gallai-Edmonds decomposition |
| Page length (in bytes) | 9,118 |
| Namespace ID | 0 |
| Page ID | 229253 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>LinuxGuru |
| Date of page creation | 19:45, 6 February 2024 |
| Latest editor | imported>LinuxGuru |
| Date of latest edit | 19:45, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In graph theory, the Gallai–Edmonds decomposition is a partition of the vertices of a graph into three subsets which provides information on the structure of maximum matchings in the graph. Tibor Gallai and Jack Edmonds independently discovered it and proved its key properties.
The Gallai–Edmonds decomposition... |
