Young graph

E2275395 UNEXPLORED

The Young graph is an infinite graded graph whose vertices are integer partitions (or Young diagrams) and whose edges correspond to adding a single box, encoding the branching of symmetric group representations.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
Young graph canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Gelfand–Tsetlin graph → relatedTo → Young graph ⓘ