Abstract / Synopsis

We analyze the famous Anton Chekhov play Uncle Vanya by means of graph theory. Moreover, we make the ‘brave’ suggestion that Chekhov might have used graphs to represent the plot of the play and the relationships between characters. Our analysis also includes the analysis of a specific performance of the play held in Bielsko-Biała which differs slightly from the original script. The differences between the two versions are traced via graph-based analyses. When a first round of clique assignments did not give much insight we transformed them via a sequence of operations on consecutive graphs. The final graphs obtained this way from the two versions of the play differ only by one loop, which disturbs the initially intended symmetry. We explore some of the unexpected consequences.



Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.