Abstract
We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments by giving an algorithmic construction of such a bijection. © 2001 Academic Press.
Author supplied keywords
Cite
CITATION STYLE
APA
Chapman, R. (2001). Alternating sign matrices and tournaments. Advances in Applied Mathematics, 27(2–3), 318–335. https://doi.org/10.1006/aama.2001.0737
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free