Abstract
Majorization arises in several related topics of a basically combinatorial nature, namely, in graph theory, the theory of network flows, and the study of incidence matrices. As is to be expected, results can often be stated equivalently in the language of each discipline. Some of this language is reviewed in Section A. An excellent discussion of matrix theory and graph theory is given by Brualdi (2006). In combinatorial analysis, majorization is almost always in integers. See 5.D.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Marshall, A.W., Olkin, I., Arnold, B.C. (2010). Combinatorial Analysis. In: Inequalities: Theory of Majorization and Its Applications. Springer Series in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-68276-1_7
Download citation
DOI: https://doi.org/10.1007/978-0-387-68276-1_7
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-40087-7
Online ISBN: 978-0-387-68276-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)