A planar graph as a topological model of a traditional fairy tale

The primary objective of this study was to propose a functional discrete mathematical model for analyzing folklore fairy tales. Within this model, characters are denoted as vertices, and explicit instances of communication – both verbal and non-verbal – within the text are depicted as edges. Upon examining a corpus of Eastern Slavic fairy tales in comparison to Chukchi fairy tales, unforeseen outcomes emerged. Notably, the constructed models seem to evade establishing certain connections between characters. Consequently, instances where the interactions among fairy tale characters would result in a non-planar graph structure are notably absent. To put it differently, the models refrain from incorporating sub-graphs delineated by the Kuratowski theorem governing planar graphs, specifically the minimal non-planar graphs Κ5 and Κ3,3. Remarkably, even in more extensive texts featuring a larger cast of characters, connections that would yield a non-planar graph pattern are consistently avoided. This leads to the formulation of a hypothesis positing that traditional folk tales adhere to a “planar narrative” design – an identifiable narrative variant characterized by inherent limitations in complexity. This design, in turn, appears deeply entrenched within the societal framework of the cultures that produced these folk narratives.