The Friendship Theorem and Minimax Theorems

Simple item page
dc.creatorMehendale, Dhananjay P.
dc.date2005-03-25
dc.date.accessioned2026-07-07T05:18:26Z
dc.date.available2026-07-07T05:18:26Z
dc.descriptionWe propose a generalization of Halls marriage theorem. The generalization given here provides a necessary sufficient condition for arranging a successful friendship among n number of k sets. We define multimatrix, multideterminant, multideterminantal monomials, and show that the existence of a nonzero multideterminantal monomial implies the desired existence of a successful friendship. Every nonzero multideterminantal monomial represents a possible way to achieve a successful friendship. A generalization of Mengers theorem and that of some minimax theorems is stated.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0503578
dc.identifierhttp://arxiv.org/abs/math/0503578
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74663
dc.subjectGeneral Mathematics
dc.titleThe Friendship Theorem and Minimax Theorems
dc.typetext

Files

Collections

arXiv