Giulio Fellin / Essay

The Curious Case of Poirot’s Centrality.

What connects Agatha Christie’s characters? Graph theory offers some surprising answers.

View PDF ↗
Copy citation

Agatha Christie’s detective fiction comprises several recurring series, each centred on a principal detective or another recurring character. Although these series are largely independent, Christie occasionally reused characters across them, creating a connected fictional universe. We study the co-appearance graph, where two participating characters are adjacent whenever they occur together in a work. One-off characters are included in the connected component. We cover the connected corpus by nine major subuniverses and use the work–character incidence relation to calculate the centre and diameter. For the stated catalogue and appearance conventions, the radius is three; Poirot and his valet George are joint centres; and the diameter is six. The result illustrates how literary modelling choices and graph-theoretic reduction interact.

Spoiler warning. This article identifies recurring casts and relationships in Christie’s novels and stories. Even the later reappearance of a character can constitute a minor spoiler.

Introduction

Agatha Christie (1890–1976) created one of the largest and most influential collections of detective fiction. Although many of her novels and short stories are self-contained, a substantial number feature recurring characters. These recurring appearances connect otherwise independent stories into a single fictional universe, whose structure can be studied using the tools of graph theory.

Illustrated detective board with recurring characters
Figure 1. An illustrated detective board evoking the connections between recurring characters in Agatha Christie's fictional universe. The illustration is intended as an evocative picture, not a graph used in the proofs.

A particularly notable example of Christie’s use of crossover characters is Cards on the Table, which brings together four of her major recurring characters—Hercule Poirot, Colonel Race, Superintendent Battle, and Ariadne Oliver. More generally, recurring characters connect the various detective series and supporting casts into a single connected network.

The most interesting features of the graph arise from a small number of characters who cross the boundaries between Christie’s different series. These characters do not necessarily have the largest number of appearances, but they act as bridges between otherwise separate parts of the network. Examples include Mr. Satterthwaite, whose association with Harley Quin connects the Quin stories to Poirot’s world; Miss Lemon and Ariadne Oliver, who link Parker Pyne to Poirot; and Mr. Robinson, who connects Poirot, Miss Marple, and the Beresfords.

The appearance data and publication history were compiled from Christie reference works [3, 4, 5], supplemented by a work-by-work crossover register. Bunson catalogues the characters and publications, while Curran helps with posthumous materials.

The graph and the character census

We begin with all Christie’s novels and short stories. A full-length novel counts as one work. We decide to treat the same way episodic, narratively cohesive works, even though they are sometimes catalogued as short-story collections [2], including The Big Four, Partners in Crime, and The Labours of Hercules. Alternative titles for the same narrative do not introduce new works. Distinctly written versions may be included separately, since a different cast can introduce different edges.

Write \(\mathcal C\) for this initial collection of works and \(\widetilde C(W)\) for the individual characters who participate in a work \(W\). A character who is merely named in passing, without participating in the narrative, is not counted.

For simplicity, we represent each of closely associated couples by a single vertex, in particular: Tommy and Tuppence Beresford (the Beresfords), Caleb and Maud Dane Calthrop (the Dane Calthrops), and John and Rhoda Despard (the Despards), as both members of each pair occur in exactly the same works. Consequently their neighbourhoods agree, and identifying each pair does not shorten distances between any of the other vertices. Formally, let \(q\) be the map identifying the members of each designated pair and fixing all other characters, and put \[C(W)=\{q(x):x\in\widetilde C(W)\}.\]

Construct an ambient co-appearance graph \(\Gamma\) on the union of the sets \(C(W)\) for \(W\in\mathcal C\). Two distinct vertices are adjacent if they occur together in at least one \(C(W)\). Now let \(G\) be the connected component of \(\Gamma\) containing Hercule Poirot, and define \[\mathcal W=\{W\in\mathcal C:C(W)\cap V(G)\ne\varnothing\}.\] Thus the works under study are determined by connectedness to Poirot. If one character in a work belongs to \(G\), all its characters belong to \(G\).

Uncertain character identities

Character identity matters mathematically: identifying two apparently distinct figures replaces two vertices by one and unites their neighbours, potentially creating shorter paths. Reference sources do not always agree about whether recurring names refer to the same person. For instance, Bunson treats the Meadows, Spence, and Leatheran appearances listed below as distinct [3]; other discussions identify the names across works. The status of Parker Pyne’s Miss Lemon is likewise debated: Christie’s official guide identifies her with Poirot’s secretary [6], whereas an account of Parker Pyne Investigates records the continuing disagreement among Christie readers [1].

We adopt the following conventions:

  • Felicity Lemon. Pyne’s secretary, appearing from The Case of the Middle-aged Wife, is identified with Poirot’s later secretary. The difference in her characterisation across the stories is the reason for the competing interpretation.

  • Inspector Meadows. The inspector in The Man in the Brown Suit and the one in The Big Four are represented as two distinct characters. A shared surname is not by itself sufficient to establish identity.

  • Superintendent Spence. The Spence of Taken at the Flood is identified with the Spence appearing in Mrs McGinty’s Dead, Hallowe’en Party, and Elephants Can Remember.

  • Amy Leatheran. The nurse in Murder in Mesopotamia is identified with the character of the same name in Passenger to Frankfurt.

The subuniverses and their crossovers

The graph has many local clusters, but its larger structure is organised by a small number of major recurring figures. The nine vertices in Table Table 1 serve as anchors of subuniverses.

AnchorFirst appearance
Hercule PoirotThe Mysterious Affair at Styles (1920)
The BeresfordsThe Secret Adversary (1922)
Colonel John RaceThe Man in the Brown Suit (1924)
Harley QuinThe Coming of Mr Quin (1924)
Superintendent BattleThe Secret of Chimneys (1925)
Miss Jane MarpleThe Tuesday Club Murders (1927)
Christopher Parker PyneThe Case of the Middle-aged Wife (1932)
Ariadne OliverThe Case of the Discontented Soldier (1932)
Mr. RobinsonCat Among the Pigeons (1959)
Table 1. The nine anchors and their literary debuts. The Beresfords constitute one vertex throughout the analysis.
WorkAnchors appearing together
The Case of the Discontented SoldierPyne, Oliver
The Case of the Rich WomanPyne, Oliver
Cards on the TablePoirot, Oliver, Race, Battle
Death on the NilePoirot, Race
Mrs McGinty's DeadPoirot, Oliver
Hercule Poirot and the Greenshore FollyPoirot, Oliver
Dead Man's FollyPoirot, Oliver
Cat Among the PigeonsPoirot, Robinson
At Bertram's HotelMarple, Robinson
Third GirlPoirot, Oliver
Hallowe'en PartyPoirot, Oliver
Elephants Can RememberPoirot, Oliver
Postern of FateBeresfords, Robinson
Table 2. Works featuring more than one subuniverse anchor. Each work induces a clique on the anchors listed in the second column.

Let \(\mathcal A\) be the set of these nine anchors. For each \(a\in\mathcal A\), its subuniverse is the set of works in which it appears: \[\mathcal U_a=\{W\in\mathcal W:a\in C(W)\}.\] These sets form a cover of our corpus: \[\mathcal W=\bigcup_{a\in\mathcal A}\mathcal U_a.\] In other words, every one of the works in the register contains at least one of the nine anchors. This, of course, is not a partition: for example, Cards on the Table lies in the subuniverses of Poirot, Oliver, Race, and Battle.

The crossover characters

We call a recurring vertex a crossover if it appears in at least two distinct works whose subuniverse memberships include at least two distinct \(\mathcal U_a\). A one-off character in a work shared by several anchors is not a recurring crossover. In this precise sense a supporting character can count as a crossover even when a shared novel, rather than a separate detective series, provides the connection. The anchor vertices themselves have several crossover appearances: Cards on the Table, for instance, brings together Poirot, Oliver, Race, and Battle.

Besides the nine anchors, there are twelve crossover vertices under the adopted conventions. Table Table 3 lists all of them, with the subuniverses they intersect and the appearances establishing their connections. The Dane Calthrops and Despards each occupy a single row and vertex.

CharacterSubuniverseConnecting appearances
Mr. Satterthwaite—Quin (all stories); Poirot (The Second Gong, Three Act Tragedy, Dead Man's Mirror).
Miss Felicity Lemon—Pyne (early stories); Poirot (later stories); Oliver (Dead Man's Folly, Third Girl, Elephants Can Remember).
Caleb and Maud Dane Calthrop—Marple (The Moving Finger); Oliver (The Pale Horse).
Amy Leatheran—Poirot (Murder in Mesopotamia); Robinson (Passenger to Frankfurt).
John and Rhoda DespardOliverPoirot, Race, Battle (Cards on the Table).
Colonel PikeawayRobinsonPoirot (Cat Among the Pigeons); Beresfords (Postern of Fate).
GeorgePoirotRobinson (Cat Among the Pigeons); Oliver (Mrs McGinty's Dead, Third Girl, Hallowe'en Party, Elephants Can Remember).
Albert BattBeresfordsRobinson (Postern of Fate).
Deborah BeresfordBeresfordsRobinson (Postern of Fate).
Mr. GobyPoirotOliver (Third Girl, Elephants Can Remember).
Dr. John StillingfleetPoirotOliver (Third Girl).
Superintendent SpencePoirotOliver (Mrs McGinty's Dead, Hallowe'en Party, Elephants Can Remember).
Table 3. Recurring crossover characters. The subuniverse, when specified, is one whose anchor appears in every work featuring the character. The last column records appearances in the remaining subuniverses. A dash indicates that no single anchor accompanies the character throughout.

Other recurring figures, such as Hastings, Japp, Joseph Aarons, and Vera Rossakoff, contribute further co-appearance edges within the Poirot circle: for example, Japp and George meet Miss Lemon in The Labours of Hercules, while several members of the Poirot cast meet in The Big Four. Such encounters remain part of the graph even though they do not constitute crossovers by our definition.

There is one noteworthy borderline case: in The Secret Adversary, Inspector Japp’s visiting card is delivered to Julius Hersheimmer. This suggests Japp’s presence just outside the narrated action, and is certainly more significant than an incidental mention of his name. Nevertheless, Japp is not present as a participating character in that scene. Under our explicit criterion we do not create a Japp–Beresfords edge. This borderline case is worth recording.

Table Table 4 gives the subuniverse–crossover incidence matrix, while Figure Figure 2 shows the co-appearance graph induced on precisely the nine anchors and twelve non-anchor crossover vertices. Both are complete for their stated vertex and work sets; neither is claimed to preserve all shortest paths in \(G\).

Crossover vertexPBRQTMYOX
Satterthwaite●––●–––––
Miss Lemon●–––––●●–
Dane Calthrops–––––●–●–
Despards●–●–●––●–
Amy Leatheran●–––––––●
Colonel Pikeaway●●––––––●
George●––––––●●
Albert Batt–●––––––●
Deborah Beresford–●––––––●
Mr. Goby●––––––●–
Dr. Stillingfleet●––––––●–
Superintendent Spence●––––––●–
Table 4. Incidence of the twelve non-anchor crossover vertices with the nine subuniverses. A bullet indicates that the character appears in a work featuring the anchor. P = Poirot; B = Beresfords; R = Race; Q = Harley Quin; T = Battle; M = Marple; Y = Parker Pyne; O = Oliver; X = Robinson. Couples consistently appear as single vertices.
Co-appearance network of nine anchor vertices and twelve crossover characters
Figure 2. The induced co-appearance graph on the nine anchor vertices (rose outlines) and the twelve additional crossover vertices (blue outlines). All \(54\) same-work edges among these \(21\) vertices are included. The layout was chosen to separate the principal branches and make the labels readable. Theorem thm:reduction shows that distances between vertices of this induced graph agree with their distances in the full graph \(G\).

The cover and the induced graph

The cover \[\mathcal W=\bigcup_{a\in\mathcal A}\mathcal U_a\] has a simple but important consequence: every vertex of \(G\) is either one of the nine anchors or is adjacent to at least one of them. In particular, for any character \(c\) belonging to the induced graph of Figure Figure 2, and any \(v\in G\), we can choose an anchor \(a\) associated with a work containing \(v\) and obtain \[ d_G(c,v)\le d_G(c,a)+1.\] Thus distances from a comparatively small set of characters give upper bounds for the whole universe.

Let \(H\) be the graph induced by the nine anchors and the twelve recurring crossover vertices described in Section 3. Although every character of \(G\) is close to an anchor, one must still consider whether omitted characters introduce shorter paths between vertices of \(H\).

The cover gives an upper bound, but not necessarily the shortest route. A character may also appear with one or more recurring crossover characters, and a path through one of them can be shorter than a path through the subuniverse’s anchor. To use the smaller graph for exact distances, we need a stronger observation.

For any two characters \(x,y\in V(G)\), there is a shortest \(x\)–\(y\) path whose internal vertices all belong to \(H\). In particular, for \(x,y\in V(H)\) we have \[d_G(x,y)=d_H(x,y).\]

Proof. Among all shortest paths from \(x\) to \(y\), choose one having as few internal vertices outside \(H\) as possible. Suppose that \(v\) is one such vertex, with predecessor \(u\) and successor \(w\) on the path.

If \(v\) occurs in only one work \(W\), both \(u\) and \(w\) also occur in \(W\). Hence \(u\) and \(w\) are adjacent, contradicting the fact that the path is shortest.

Otherwise \(v\) is recurring. As \(v\) is not in \(H\), it is not a crossover: all its appearances belong to one subuniverse \(\mathcal U_a\), with anchor \(a\in H\). Every work containing \(v\) therefore contains \(a\). In particular, both \(u\) and \(w\) are adjacent to \(a\) (or equal to it). If \(a\) equals \(u\) or \(w\), the path can be shortened; otherwise we can replace \[u\longrightarrow v\longrightarrow w \quad\text{by}\quad u\longrightarrow a\longrightarrow w.\] This gives another shortest path with fewer internal vertices outside \(H\), again a contradiction.

Thus such a \(v\) cannot exist. If \(x,y\in H\), the resulting shortest path lies entirely in \(H\), and since \(H\) is a subgraph of \(G\), \[d_G(x,y)=d_H(x,y).\] ◻

This gives a systematic description of how shortest paths enter and leave \(H\). For \(x\notin H\), put \[N_H(x)=N_G(x)\cap V(H).\] The covering property ensures that \(N_H(x)\) is nonempty. If \(x\notin H\) and \(y\in H\), then \[ d_G(x,y)=1+\min_{a\in N_H(x)}d_H(a,y).\] If \(x,y\notin H\) are distinct and nonadjacent, then \[ d_G(x,y)= 2+\min_{\substack{a\in N_H(x)\\ b\in N_H(y)}}d_H(a,b).\] For adjacent characters the distance is, of course, one. These formulas follow by taking the first and last edges of the shortest path supplied by the theorem. Importantly, the minimum runs over all neighbours in \(H\), not just the nine anchors. This is exactly where a recurring crossover character can shorten a route.

Harley Quin provides a particularly clear example. Every story featuring Quin also features Mr. Satterthwaite. Therefore a character \(x\) appearing with Quin is either Satterthwaite or is also adjacent to Satterthwaite. When \(x\notin H\), both Quin and Satterthwaite belong to \(N_H(x)\). For reaching Poirot, the path through Satterthwaite is shorter: \[d_H(\mathrm{Satterthwaite},\mathrm{Poirot})=1, \qquad d_H(\mathrm{Quin},\mathrm{Poirot})=2.\] More generally, Quin can be replaced by Satterthwaite as an internal vertex of a path whose endpoints are different from Quin, without increasing its length. The refinement is thus an instance of the general shortest-path principle, rather than an additional exception.

Subuniverse anchors
Vertex of \(H\)Hercule PoirotBeresfordsColonel RaceHarley QuinSuperintendent BattleMiss MarpleParker PyneAriadne OliverMr. Robinson\(M(v)\)
Hercule Poirot0212122112
Beresfords2034324314
Colonel Race1303132123
Harley Quin2430344334
Superintendent Battle1313032123
Miss Marple2234303214
Parker Pyne2424230134
Ariadne Oliver1313121023
Mr. Robinson1123213203
Mr. Satterthwaite1321233223
Miss Lemon1323231123
Dane Calthrops2324212124
Despards1313122123
Amy Leatheran1223223213
Colonel Pikeaway1123223213
George1223222113
Albert Batt2134324314
Deborah Beresford2134324314
Mr. Goby1323232123
Dr. Stillingfleet1323232123
Superintendent Spence1323232123
Table 5. Distances \(d_H(v,a)\) from each vertex \(v\) of the induced graph \(H\) to the nine anchors \(a\). The last column is \(M(v)=\max_{a\in\mathcal A}d_H(v,a)\).

To see which characters give the strongest bounds, it is useful to consider all distances from vertices of \(H\) to the nine anchors, rather than selecting particular characters in advance. Table Table 5 gives these distances. The final column records \[M(v)=\max_{a\in\mathcal A}d_H(v,a),\] the greatest distance from \(v\) to any anchor.

The Poirot row of Table Table 5 has \(M(\mathrm{Poirot})=2\). By (1), every character of \(G\) is therefore at distance at most three from Poirot.

The George row has distance at most two to every anchor except Harley Quin, at distance three. This apparent exception is resolved by the crossover through Satterthwaite: every character in a Quin story is either Satterthwaite or adjacent to him, and Satterthwaite is at distance two from George. Quin himself is at distance three from George. Consequently \[ \operatorname{ecc}_G(\mathrm{Poirot})\le3, \qquad \operatorname{ecc}_G(\mathrm{George})\le3.\]

The centre and diameter

To determine whether these bounds are sharp, and whether any other character can attain them, consider two characters at opposite ends of the network: \[\begin{aligned} p&=\text{Mrs Peters, in \emph{The Oracle at Delphi}},\\ b&=\text{Sir James Peel Edgerton, in \emph{The Secret Adversary}}. \end{aligned}\] Neither character appears in another work [7, 8]. Among the vertices of \(H\), Mrs Peters is adjacent only to Parker Pyne, whereas Sir James is adjacent to the Beresfords and Albert Batt. Since Albert accompanies the Beresfords in all their adventures, he and the Beresfords have the same closed neighbourhood in the graph. In particular, the induced graph \(H\) satisfies \[ d_H(\mathrm{Pyne},\mathrm{Beresfords}) =d_H(\mathrm{Pyne},\mathrm{Albert})=4.\] Two shortest routes to the Beresfords are \[\begin{aligned} &\mathrm{Pyne}\to\mathrm{Lemon} \to\mathrm{Poirot}\to\mathrm{Robinson} \to\mathrm{Beresfords},\\ &\mathrm{Pyne}\to\mathrm{Lemon} \to\mathrm{George}\to\mathrm{Robinson} \to\mathrm{Beresfords}. \end{aligned}\] The distance formula (3) therefore gives \[ d_G(p,b)=1+4+1=6.\]

In \(H\), the only vertices lying at distance at most two from both Pyne and the Beresfords are \[ B_2^H(\mathrm{Pyne}) \cap B_2^H(\mathrm{Beresfords}) =\{\mathrm{Poirot},\mathrm{George}\},\] where \(B_2^H(x)\) denotes the ball of radius two about \(x\) in \(H\). The same intersection results if the Beresfords are replaced by Albert. Thus Poirot and George are the only vertices of \(H\) at distance three from both \(p\) and \(b\).

Could a character \(v\) outside \(H\) also be at distance three from both witnesses? Since \(v\) is not adjacent to either \(p\) or \(b\), formula (3) applies to both pairs. It shows that \(v\) must have a neighbour \[u\in\{\mathrm{Lemon},\mathrm{Oliver}\}\] and another neighbour \[w\in\{\mathrm{Robinson},\mathrm{Pikeaway}, \mathrm{Deborah}\}\] in \(H\). The first set comprises the neighbours of Pyne in \(H\); the second comprises the neighbours of the Beresfords or Albert that can occur when \(d_G(v,b)=3\).

If \(v\) appeared in only one work, then \(u\) and \(w\) would be adjacent, yielding a path of length three from Pyne to the Beresfords, contrary to (5).

If \(v\) recurs, it is not a crossover and therefore all its works contain one anchor \(a\). Both \(u\) and \(w\) are adjacent to \(a\), so \[\mathrm{Pyne}\to u\to a\to w \to\mathrm{Beresfords}\] is a shortest path in \(H\). By (7), the anchor \(a\) must be Poirot. But Deborah is not adjacent to Poirot, so \(w\) is Robinson or Pikeaway. If \(w\) is Robinson, a work containing both \(v\) and \(w\) is already in Robinson’s subuniverse. If \(w\) is Pikeaway, the work in which he appears with Poirot is Cat Among the Pigeons, which also features Robinson. In either case \(v\) appears in both the Poirot and Robinson subuniverses. As \(v\) recurs, it would be a crossover vertex and hence belong to \(H\), a contradiction.

Consequently no vertex outside \(H\) can be at distance three from both witnesses.

The centre of \(G\) consists of Poirot and George, and its radius is three: \[\operatorname{Center}(G) =\{\mathrm{Poirot},\mathrm{George}\}, \qquad \operatorname{rad}(G)=3.\]

Proof. The upper bounds follow from (4). Both Poirot and George are at distance three from Mrs Peters, so each has eccentricity exactly three.

Suppose another vertex \(v\) had eccentricity at most three. In particular, \(d_G(p,v)\le3\) and \(d_G(v,b)\le3\). Since \(d_G(p,b)=6\), the triangle inequality forces \[d_G(p,v)=d_G(v,b)=3.\] Thus \(v\) would be the middle vertex of a shortest path from \(p\) to \(b\). The preceding argument shows that the only possibilities are Poirot and George, which proves \[\operatorname{Center}(G) =\{\mathrm{Poirot},\mathrm{George}\}, \qquad \operatorname{rad}(G)=3.\] ◻

George’s position may seem surprising: he has no independent detective series. What matters is that, besides being close to Poirot, he also meets Mr. Robinson and several of the other connecting characters. In the co-appearance metric these links place him as close to the most remote branches as Poirot himself.

The diameter of \(G\) is six.

Proof. Since Poirot has eccentricity three, the triangle inequality implies that for any two vertices \(u,v\), \[d_G(u,v) \le d_G(u,\mathrm{Poirot}) +d_G(\mathrm{Poirot},v)\le6.\] On the other hand, the two peripheral characters in (6) are at distance six. Therefore \[\operatorname{diam}(G)=6.\] ◻

The four character identities described in Section 2 can be treated independently: each pair of appearances may either be identified or kept separate. Under all sixteen resulting combinations, the centre remains \(\{\mathrm{Poirot},\mathrm{George}\}\), the radius remains three, and the diameter remains six.

These invariants depend, however, on the meaning of an appearance. Counting a reference to an absent character as a co-appearance may introduce an edge that is not justified by the narratives. Similarly, changing whether a work is treated as a single novel or as several separate stories can change which characters are adjacent.

Concluding remarks

Christie’s fictional universe consists of largely independent subuniverses linked by relatively few crossover characters. The nine named subuniverses cover all works in the analysed corpus. Twelve additional crossover vertices intersect at least two of them. The work-based analysis shows that even a supporting character such as Poirot’s valet George can occupy a central position in the resulting graph.

Within the full co-appearance network, Poirot occupies a prominent but not unique central position. Both Poirot and George have eccentricity three, and together they form the centre. The diameter is six, realised between characters belonging to the Parker Pyne and Beresfords circles.

The metric structure is sensitive to relatively few crossover appearances. For example, the link between Miss Marple and Robinson in At Bertram’s Hotel shortens routes between their subuniverses. Precise definitions of identity, participation, and co-appearance are therefore part of the mathematical argument.

More broadly, the construction gives a graph-theoretic description of a fictional universe, and illustrates a useful technique for networks made from overlapping groups. Recording the memberships of the groups allows us to separate global connecting characters from peripheral vertices, and to use group-covering bounds and distance witnesses to compute the centre and diameter. This also suggests classroom investigations: which crossover appearance changes the centre, which identity decision changes the diameter, and which features are robust?

References

  1. Parker Pyne Investigates, Wikipedia, https://en.wikipedia.org/wiki/Parker_Pyne_Investigates, accessed November 2026.
  2. Agatha Christie Ltd., Partners in Crime, https://www.agathachristie.com/en/stories/partners-in-crime.
  3. Matthew Bunson, The Complete Christie: An Agatha Christie Encyclopedia, Pocket Books, New York, 2000.
  4. Agatha Christie, The Complete Short Stories, 3 volumes, HarperCollins, London, 2008.
  5. John Curran, Agatha Christie’s Complete Secret Notebooks, HarperCollins, London, 2009.
  6. Agatha Christie Ltd., The Case of the Middle-aged Wife, https://www.agathachristie.com/en/stories/the-case-of-the-middle-aged-wife.
  7. Agatha Christie Ltd., The Oracle at Delphi, https://www.agathachristie.com/en/stories/the-oracle-at-delphi-1.
  8. Agatha Christie Ltd., The Secret Adversary, https://www.agathachristie.com/en/stories/the-secret-adversary.