A concise proof of the Littlewood-Richardson rule.
Stembridge, John R. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Stembridge, John R. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
McNamara, Peter J. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
van Leeuwen, Marc A.A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Knutson, Allen, Purbhoo, Kevin (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Nahay, John Michael (2002)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Caselli, F., Krattenthaler, C., Lass, B., Nadeau, P. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Behrend, Roger E. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Halverson, Tom, Lewandowski, Tim (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vallejo, Ernesto (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kasraoui, Anisse, Zeng, Jiang (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Lapointe, Luc, Le Borgne, Yvan, Nadeau, Philippe (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
F. Y. Wu, C. King, W. T. Lu (1999)
Annales de l'institut Fourier
Similarity:
The Tutte polynomial is a generalization of the chromatic polynomial of graph colorings. Here we present an extension called the rooted Tutte polynomial, which is defined on a graph where one or more vertices are colored with prescribed colors. We establish a number of results pertaining to the rooted Tutte polynomial, including a duality relation in the case that all roots reside around a single face of a planar graph.