Minimum codegree condition for perfect matchings in k‐partite k‐graphs (Q5207463): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2910955978 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1711.08185 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 00:43, 20 April 2024
scientific article; zbMATH DE number 7146795
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum codegree condition for perfect matchings in k‐partite k‐graphs |
scientific article; zbMATH DE number 7146795 |
Statements
Minimum codegree condition for perfect matchings in k‐partite k‐graphs (English)
0 references
30 December 2019
0 references
\(k\)-graph
0 references
\(k\)-partite \(k\)-graph
0 references
matching
0 references
perfect matching
0 references
