Abstract
The Frobenius-König Theorem has a central role in combinatorial matrix theory; it characterizes when a (0,1)-matrix X contains a permutation matrix P (meaning P≤X entrywise). Our goal is to investigate similar questions for (0,±1)-matrices, and a main result is a Frobenius-König Theorem for the class of (0,±1)-matrices with all row and column sums being 1. Moreover, some related results are shown for alternating sign matrices.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
