Unbiased Version of Hall's Marriage Theorem in Matrix Form

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F19%3A10405684" target="_blank" >RIV/00216208:11320/19:10405684 - isvavai.cz</a>
Result on the web
<a href="https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=4v0CpuhV-v" target="_blank" >https://verso.is.cuni.cz/pub/verso.fpl?fname=obd_publikace_handle&handle=4v0CpuhV-v</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1080/00029890.2019.1640531" target="_blank" >10.1080/00029890.2019.1640531</a>

Result language
angličtina
Original language name
Unbiased Version of Hall's Marriage Theorem in Matrix Form
Original language description
Inspired by an old result by Georg Frobenius, we show that the unbiased version of Hall's marriage theorem is more transparent when reformulated in the language of matrices. At the same time, we obtain a more general statement applicable to bipartite graphs whose parts need not have the same size.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GA18-00449S" target="_blank" >GA18-00449S: The impact of WWI on the formation and transformation of the scientific life of the mathematical community</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)