Abstract 1 Introduction 2 Some terminology and tools 3 Proof of Theorem 2 4 Concluding remarks References

The Maximum Number of Digons Formed by Pairwise Intersecting Pseudocircles

Eyal Ackerman ORCID Department of Mathematics, Physics and Computer Science, University of Haifa at Oranim, Tivon, Israel Gábor Damásdi ORCID HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
ELTE Eötvös Loránd University, Budapest, Hungary
Balázs Keszegh ORCID HUN-REN Alfréd Rényi Institute of Mathematics, Budapest, Hungary
ELTE Eötvös Loránd University, Budapest, Hungary
Rom Pinchasi ORCID Technion – Israel Institute of Technology, Haifa, Israel Rebeka Raffay ORCID École Polytechnique Fédérale de Lausanne (EPFL), Lausanne, Switzerland
Abstract

In 1972, Branko Grünbaum conjectured that any nontrivial arrangement of n>2 pairwise intersecting pseudocircles in the plane can have at most 2n2 digons (regions enclosed by exactly two pseudoarcs), with the bound being tight. While this conjecture has been confirmed for cylindrical arrangements of pseudocircles and more recently for geometric circles, we extend these results to any simple arrangement of pairwise intersecting pseudocircles.

Keywords and phrases:
pairwise intersecting arrangement, arrangement of pseudocircles, counting digons, tangencies, Grünbaum’s conjecture
Funding:
Gábor Damásdi: Research supported by ERC grant No. 882971, “GeoScape” and by the Eköp-24 university excellence scholarship program of the Ministry for Culture and Innovation from the source of the National Research, Development and Innovation Fund.
Balázs Keszegh: Research supported by the János Bolyai Research Scholarship of the Hungarian Academy of Sciences, by the National Research, Development and Innovation Office – NKFIH under the grant K 132696 and FK 132060, by the ÚNKP-23-5 New National Excellence Program of the Ministry for Innovation and Technology from the source of the National Research, Development and Innovation Fund and by the ERC Advanced Grant “ERMiD”. This research has been implemented with the support provided by the Ministry of Innovation and Technology of Hungary from the National Research, Development and Innovation Fund, financed under the ELTE TKP 2021-NKTA-62 funding scheme.
Copyright and License:
[Uncaptioned image] © Eyal Ackerman, Gábor Damásdi, Balázs Keszegh, Rom Pinchasi, and Rebeka Raffay; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Mathematics of computing Discrete mathematics
Editors:
Oswin Aichholzer and Haitao Wang

1 Introduction

In this paper we focus on families of pairwise intersecting pseudocircles. A family of pseudocircles is a set of simple closed Jordan curves in the plane such that every two of them are either disjoint, meet at exactly one point in which they touch or intersect at exactly two points in which they properly cross each other. The arrangement 𝒜() is the cell complex into which the plane is decomposed by the pseudocircles in . It consists of vertices, edges and faces. The arrangement is called trivial if there are two points that lie on every pseudocircle in . If there is no point that lies on three pseudocircles, then both the arrangement and are called simple. Note that every simple arrangement of more than two pseudocircles is nontrivial. The arrangement is called pairwise intersecting if any two pseudocircles intersect in exactly two points.

A digon is a face in the arrangement that is bounded by exactly two edges. If the two edges of a digon are contained in pseudocircles c1 and c2, respectively, then we say that c1 and c2 form that digon and that each of c1 and c2 supports it.

A trivial arrangement of n pseudocircles contains 2n digons for n>1. In his 1972 monograph “Arrangements and Spreads” [11] Branko Grünbaum conjectured that for nontrivial arrangements of pairwise intersecting pseudocircles the maximum number of digons is 2n2.

Conjecture 1 (Grünbaum’s digon conjecture [11, Conjecture 3.6]).

Every nontrivial arrangement of n>2 pairwise intersecting pseudocircles has at most 2n2 digons.

This conjecture was accompanied by a construction with exactly 2n2 digons, see Figure 1 for an example with six pseudocircles. This example can be easily extended by adding new pseudocircles to the four in the middle, which illustrates that the bound in Conjecture 1 is tight. With some care, this construction can even be realized with geometric circles. A different construction appears in [8].

Figure 1: A family of 6 pseudocircles forming 10 digons.

Conjecture 1 was shown to be true in several special cases (assuming simple arrangements). Agarwal et al. [3] showed that Conjecture 1 is true for cylindrical arrangements, these are arrangements for which there is a point that is surrounded by each of the pseudocircles. More recently, Conjecture 1 was studied and advertised by Felsner, Roch and Scheucher [8] who showed that it holds for arrangements in which there are three pseudocircles such that every two of them form a digon. This new interest in Grünbaum’s conjecture has also motivated us to study the problem. First, we were able to show in [1] that Grünbaum’s conjecture is true for simple arrangements of pairwise intersecting geometric circles. Here, using ideas from [1] and [3] we prove:

Theorem 2.

Every simple arrangement of n>2 pairwise intersecting pseudocircles has at most 2n2 digons. This bound is tight.

Our proof is inspired by the proof technique introduced in [3] for bounding the number of digons in cylindrical arrangements of n pairwise intersecting pseudocircles. In that paper, a bipartite graph is associated to a cylindrical arrangement in a way that each pseudocircle is represented by a single point which is its intersection with a common fixed transversal line. The edges of this graph correspond to digons and are drawn according to a simple yet clever rule such that every two independent edges cross an even number of times. The Strong Hanani-Tutte Theorem (see below) then implies that the drawn (bipartite) graph is planar and hence by Euler’s formula has at most 2n4 edges.

For the general case of Grünbaum’s conjecture, we combine a modification of this graph drawing technique and a graph doubling technique that was used for the case of geometric circles in [1]. Namely, a bipartite graph is drawn such that every pseudocircle is represented by two points which are its intersection with a common transversal pseudocircle. Furthermore, every digon is represented by two edges that are drawn following a rule in the spirit of [3] such that every two independent edges cross an even number of times. Therefore, the drawn (bipartite) graph is planar and hence has at most 2(2n)4=4n4 edges, representing at most 2n2 digons.

Note that our result can be applied for bounding the number of touching points in simple arrangements where any two pseudocircles intersect or touch. In any such arrangement of n>2 pseudocircles, one can turn each touching point into exactly one digon between the two pseudocircles that support the touching. Therefore, for simple arrangements, an upper bound on the number of digons translates directly to a bound on the number of touching pairs or equivalently (in this case) touching points. One can also turn each digon into exactly one touching point in the case of simple arrangements if n>3, but for n=3, two pseudocircles may touch the third one at separate points forming a single digon (the region bounded by the entire third pseudocircle), see Figure 2. In this scenario, turning the digon into a touching point would reduce the third pseudocircle to a single point, which is degenerate, and the final arrangement would violate the assumptions on the number of crossings.

Figure 2: If we allow touchings and n=3, then a digon might be surrounded by only one pseudocircle.

The transformation from digons to touching points or vice versa keeps their sum constant at every step (except for n=2 or in the above-mentioned case), therefore they are equivalent for n>3. From Theorem 2, we have:

Corollary 3.

Every simple arrangement of pseudocircles where any two pseudocircles intersect or touch has at most 2n2 touching pairs of pseudocircles. For n>3, the sum of digons and touching pairs is at most 2n2.

1.1 Outline

In Section 2 we collect useful observations and results that we need for the main proof. In Section 3 we prove Theorem 2, and in Section 4 we discuss some open questions.

2 Some terminology and tools

We begin with some simple definitions and observations, some of which also appear in [1] in the context of circles.

Let be a simple family of n>2 pairwise intersecting pseudocircles in the plane. We may assume (and we will assume from now on) that every pseudocircle in supports at least one digon. Otherwise, we can remove any pseudocircle from that does not satisfy this condition and argue for the remaining family of pseudocircles.

As touchings are forbidden in a pairwise intersecting family, each digon is supported by exactly two pseudocircles. A digon is called a lens if it is surrounded by both supporting pseudocircles, and it is called a lune otherwise. A lune must be surrounded by precisely one of its supporting pseudocircles, while lying outside the region surrounded by the other (see Figure 3). Here we ignore the case where the unbounded face is a digon. This indeed can be avoided by means of a simple inversion of the plane.

Figure 3: A lens and a lune.

A pseudocircle α is internal if it supports a digon that is surrounded by α and it is called external if it supports a digon (necessarily a lune) that is not surrounded by α. The following simple observation is important for the proof.

Proposition 4.

A pseudocircle in cannot be both internal and external.

Proof.

Assume to the contrary that there is a pseudocircle c which is both external and internal. This means that there exist c1,c2 such that c and c1 form a digon not surrounded by c while c and c2 form a digon that is surrounded by c (see Figure 4).

Figure 4: A pseudocircle cannot be both internal and external.

In such a case c1 and c2 cannot intersect, contradicting our assumption that we have an arrangement of pairwise intersecting pseudocircles. Indeed, c1 and c2 cannot cross in the region surrounded by c because that subarc of c2 is an edge of a digon. Similarly, c1 and c2 cannot intersect in the complementary region of the plane because that subarc of c1 is an edge of an other digon.

Any simple closed Jordan curve in the plane divides the plane into two parts, one bounded (the interior) and the other unbounded (the exterior). We will refer to these two parts as the regions of the curve. For a pseudocircle α, we will call the region that contains the digons supported by α the digon-region of α. By Proposition 4 and because we assume that every pseudocircle supports at least one digon, every pseudocircle in has exactly one digon-region. One advantage of this definition is that we can treat lunes and lenses in a uniform way: every digon is just the intersection of the digon-regions of the two corresponding pseudocircles supporting it.111Another way to think about this is to imagine that we work on a sphere, and we have caps corresponding to the digon-regions. This will simplify the case-analysis in some of the proofs.

It is well-known that any family of pairwise intersecting pseudocircles can be extended to a larger family of pairwise intersecting pseudocircles, and the following lemma shows that we can also do it without destroying the existing digons.

Lemma 5.

Let be a simple family of n>2 pairwise intersecting pseudocircles. Then there is a closed curve c such that {c} is a simple family of pairwise intersecting pseudocircles, and furthermore c does not intersect any of the digons in 𝒜().

Proof.

Let α be a pseudocircle in . From Proposition 4 we know that one of the two regions of α (the one that is not the digon-region of α) does not contain any digon supported by α. Let c be a curve that is running very close to α outside of the digon-region of α. Then c intersects each pseudocircle in {α} exactly twice and it intersects no digon of 𝒜(). However, c does not intersect α. In order to fix this, we notice that because is a simple arrangement of pseudocircles, there is a subarc s of α that is disjoint from any digon supported by α and consequently it is disjoint from any digon in 𝒜(). We can modify c along s such that the resulting simple closed curve crosses α at two points yielding the desired extension of (see Figure 5).

Figure 5: Extending with a curve c which avoids the digons in 𝒜() and intersects every pseudocircle in exactly twice.

For a pseudocircle α with a given orientation as a closed curve and points v1,v2 on α we denote by [v1,v2]α (resp., (v1,v2)α) the closed (resp., open) segment of α from v1 to v2 following α in the given orientation.

Proposition 6.

Let {α1,α2,c} be a simple family of pairwise intersecting pseudocircles such that α1 and α2 form a digon. Suppose that c is oriented and let αjin (resp., αjout) be the intersection point of c and αj in which c enters (resp., leaves) the digon-region of αj, for j=1,2. Then α1in,α1out,α2in,α2out is the cyclic order along c of the four intersection points of α1 and α2 with c.

Proof.

If α2in(α1in,α1out)c or α2out(α1in,α1out)c, then we have a point from α2c which lies in the digon-region of α1. However, the intersection of α2 with the digon-region of α1 consists only of the subarc of α2 which bounds the digon formed by α1 and α2. This implies that c intersects this digon which is impossible. Therefore, α1out must follow α1in in the cyclic order and, similarly, α2out must follow α2in.

A topological graph is a graph drawn in the plane such that its vertices are drawn as distinct points and its edges are drawn as Jordan arcs connecting the corresponding points. Apart from its endpoints, an edge of a topological graph cannot contain any drawn vertex. Furthermore, every two edges in a topological graph intersect at a finite number of points, each of which is either a common endpoint or a crossing point. A graph is planar if it can be drawn as a topological graph where no pair of edges crosses. By the Strong Hanani-Tutte Theorem, it is enough to require an even number of crossings between independent edges.222Two edges are independent if they do not share an endpoint.

Theorem 7 (Strong Hanani-Tutte Theorem [20]).

A graph is planar if and only if it can be drawn as a topological graph in which every two independent edges cross an even number of times.

3 Proof of Theorem 2

As we noted in the beginning of Section 2, we can suppose that is a simple family of n>2 pairwise intersecting pseudocircles in the plane such that every pseudocircle in supports at least one digon. By Lemma 5 there is a simple closed curve c that intersects each pseudocircle in twice but does not intersect the digons of the arrangement 𝒜(). We fix the counterclockwise orientation on c. Whenever we traverse c or consider a cyclic order of points on it, we do it according to this orientation. Recall that c is an auxiliary pseudocircle and it is not a member of ; in particular we do not care about digons supported by c.

Every pseudocircle α intersects c at two points such that at one of them c enters the digon-region of α and at the other c leaves this digon-region. We denote these points by αin and αout, respectively. See for example Figure 6. In this figure, the digon-regions of α and γ are the interior regions of these curves, whereas the digon-region of β is its exterior region.

Figure 6: Three pseudocircles α, β and γ and a drawing of the corresponding bipartite double cover graph G. For example, α and γ form a digon, hence we draw the edges (αout,γin) and (γout,αin) along c. Considering the (blue) edge (γout,αin), starting at βin (resp., βout) and following β towards the interior of c, we first encounter α (resp., γ). Therefore, the drawn edge (γout,αin) “passes by” βin (resp., βout) within the exterior (resp., interior) of c. Each pseudocircle’s label is placed within the digon-region associated with that pseudocircle.

3.1 The digon graph and its double cover

In order to bound from above the number of digons in 𝒜() we consider the graph Gd whose vertex set corresponds to the pseudocircles in and whose edge set corresponds to pairs of pseudocircles which form a digon in 𝒜() (since 𝒜() is nontrivial and intersecting a pair of pseudocircles may not form more than one digon). We call Gd the digon graph of the arrangement. Bounding the number of edges in Gd is equivalent to bounding the number of digons in 𝒜().

For our proof, we consider the bipartite double cover of Gd - this graph, denote it by G, has two vertices, αin and αout for every vertex α of Gd, and two edges, (αout,βin) and (βout,αin) for every edge (α,β) of Gd. Thus, the number of edges of G is twice the number of digons in 𝒜(). By construction G is bipartite. It remains to show that G is also planar and therefore has at most 2|V(G)|4=4n4 edges. This will prove Theorem 2.

3.2 Drawing 𝑮 in the plane

We draw G as a topological graph in the plane. By abuse of notation, we will not distinguish between G and its drawing. The vertices of G are represented by the points {αinα}{αoutα} as defined above. Thus, for every two pseudocircles α,β that form a digon in 𝒜() there should be two drawn edges (αout,βin) and (βout,αin). These edges will satisfy the following properties:

  1. (i)

    An edge (αout,βin) connects αout and βin, while avoiding all other vertices of G;

  2. (ii)

    every two edges intersect finitely many times; and

  3. (iii)

    an edge (αout,βin) follows very closely the subarc of c starting at αout and ending at βin, counterclockwise along c. It may cross the curve c several times, but it does not intersect the digon-regions of neither α nor β.

Properties (i), (ii), and (iii) can be easily satisfied. For the second part of (iii) note that Proposition 6 implies that when following c from αout to βin we remain outside the digon-regions of α and β.

We need one more property that the drawing of (αout,βin) should satisfy. This is the most crucial property for the proof and it has to do with how (αout,βin) is drawn with respect to the intermediate vertices of G along the arc on c from αout to βin. We use a modification of the drawing rule that appears in [3].

Let vV be an intermediate vertex of G on c along the arc from αout to βin. We will need to indicate whether the edge (αout,βin) passes near v in the interior region of c or in its exterior region. In the first case, we say that the edge passes v from the inside whereas in the second case it passes v from the outside. Other than these inside/outside decisions and properties (i)-(iii), (αout,βin) can be drawn arbitrarily.

We determine whether (αout,βin) passes v from the inside or from the outside according to the value d(v,(αout,βin)) that we define in the following way. Let γ be the pseudocircle in that intersects c at v. It follows from Proposition 6 that γ must be different from α and β. We follow the curve γ starting from v in the direction entering the interior region of c. If we intersect α sooner than we intersect β, then d(v,(αout,βin))=1, otherwise d(v,(αout,βin))=2.333Thus, the value 1 or 2 represents whether we encounter the first or the second pseudocircle among the two pseudocircles of the ordered pair (αout,βin). Since is a simple family of pairwise intersecting curves, d(v,(αout,βin)) is well-defined. If d(v,(αout,βin))=1, then we pass v from the inside. Otherwise d(v,(αout,βin))=2 and we pass v from the outside. See Figure 6 for examples.

Having described the drawing of the graph G in the plane, we will conclude the proof by showing that every two independent edges of G cross an even number of times which implies that G is planar by the Strong Hanani-Tutte Theorem (Theorem 7).

3.3 Independent edges cross evenly

Let (αout,βin) and (γout,δin) be two independent edges of G. The parity of the number of crossings between two edges depends solely on how one edge passes by a vertex of the other edge. For example, if the cyclic order of their endpoints is αout,γout,δin,βin, then the two edges cross evenly if and only if (αout,βin) passes by both of γout and δin from the inside or both of them from the outside. Therefore, it is enough to consider all the possible topologically different arrangements of the at most four involved pseudocircles (actually five because of c) and verify that in each of them (αout,βin) and (γout,δin) cross an even number of times. Using a computer we have verified this, still, for the remainder of the section (and of the proof) we provide a non-computer-aided proof.

We begin by observing that it is enough to consider the case that the involved pseudocircles α, β, γ, and δ are distinct. Indeed, (αout,βin) and (γout,δin) are independent edges, therefore, αγ and βδ. Still, it is possible that α=δ or β=γ. If α=δ and β=γ then by Proposition 6 the edges do not cross. Otherwise, we add a new pseudocircle as a substitute in the following way. Suppose without loss of generality that β=γ (if α=δ we switch the labels α and γ and the labels β and δ). Then we add a new pseudocircle γ that goes very close to β=γ outside of the digon-region of β=γ except for near the vertices of the digon formed by β=γ and δ. There, the pseudocircle γ goes into the digon-region of β=γ thus destroying the digon formed by β=γ and δ and creating a new digon with δ that is fully contained in the digon that was destroyed. See Figure 7 for an example.

Figure 7: If (αout,βin) and (γout,δin) are edges and β=γ, then we can replace γ with γ such that (αout,βin) and (γout,δin) maintain the same number of crossings as the original edges. Each pseudocircle’s label is placed within the digon-region associated with that pseudocircle.

The edge (γout,δin) starts at γout and follows the edge (γout,δin), while (αout,βin) passes by γin according the above rules. The number of crossings of the two independent edges (αout,βin) and (γout,δin) is equal to that of the original edges because (γout,δin) and (γout,δin) are drawn in precisely the same way as far as passing from the inside or from the outside of intermediate vertices of G. Note that the new vertex γin becomes an intermediate vertex for (αout,βin), however, it is not an endpoint of (γout,δin), thus it does not matter whether (αout,βin) passes it from the inside or from the outside.

Henceforth we assume that the pseudocircles α, β, γ and δ are distinct. We proceed by considering the six possible cyclic orders of the vertices αout, βin, γout and δin. If the cyclic order is (αout,βin,γout,δin), then (αout,βin) and (γout,δin) do not intersect. The cyclic orders (αout,γout,βin,δin) and (αout,δin,βin,γout) are symmetric (by switching the labels α and γ and the labels β and δ), and the same goes for the cyclic orders (αout,βin,δin,γout) and (αout,γout,δin,βin). Therefore, it is enough to consider the cyclic orders (αout,γout,βin,δin), (αout,γout,δin,βin) and (αout,δin,γout,βin).

Recall that we only care about how each edge passes by the vertices of the other edge. The following proposition summarizes the desired properties.

Proposition 8.

Assume that the following conditions are satisfied:

  1. (A)

    If αout,γout,βin and δin, appear in this cyclic order along c, then d(γout,(αout,βin))d(βin,(γout,δin));

  2. (B)

    if αout,γout,δin and βin appear in this cyclic order along c, then d(γout,(αout,βin))=d(δin,(αout,βin)); and

  3. (C)

    if αout,δin,γout and βin appear in this cyclic order along c, then d(αout,(γout,δin))d(δin,(αout,βin)) and d(γout,(αout,βin))d(βin,(γout,δin)).

Then (αout,βin) and (γout,δin) cross an even number of times.

Proof.

From properties (i), (ii) and (iii) it follows that the parity of the number of crossings between (αout,βin) and (γout,δin) depends only on the inside/outside decisions at the vertices αout,βin,γout and δin. This means that it is enough to check a single drawing for each set of inside/outside decisions that are allowed by the claim. The proof follows by a case analysis that is easy to verify by inspection, see Figure 8 for illustrations of the possible cases.

(a) The cyclic order (αout,γout,βin,δin) implies d(γout,(αout,βin))d(βin,(γout,δin)).
(b) The cyclic order (αout,γout,δin,βin) implies d(γout,(αout,βin))=d(δin,(αout,βin)).
(c) The cyclic order (αout,δin,γout,βin) implies d(αout,(γout,δin))d(δin,(αout,βin)) and d(γout,(αout,βin))d(βin,(γout,δin)).
Figure 8: (αout,βin) and (γout,δin) cross evenly if the conditions of Proposition 8 hold.

It remains to prove that the drawing of G satisfies the conditions stated in Proposition 8. Conditions (A) and (C) are shown to hold in Proposition 9 while (B) is handled in Proposition 10. Note that in Condition (C) there is a symmetry between the two edges, namely, the cyclic order can also be written as (γout,βin,αout,δin). Therefore it is enough to prove, say, that d(γout,(αout,βin))d(βin,(γout,δin)) holds for the given cyclic order of the endpoints, this is shown in the following Proposition 9.

Proposition 9.

If the cyclic of order of αout,βin,γout and δin along c is either
(αout,δin,γout,βin) or (αout,γout,βin,δin), then d(γout,(αout,βin))d(βin,(γout,δin)).

Proof.

Orient β and γ such that they enter the interior of c at βin and γout, respectively (recall that βγ). We will show that if d(γout,(αout,βin))=2, then d(βin,(γout,δin))=1. A symmetric argument (reflect the arrangement and switch the role of β and γ and also of α and δ) shows that if d(βin,(γout,δin))=1, then d(γout,(αout,βin))=2. Together, these two assertions imply the claim.

Suppose that d(γout,(αout,βin))=2. This means that as we follow γ starting from γout it intersects β before it intersects α. Let x denote this first intersection point of γ and β (see Figure 9). We will show that [βin,x]β does not intersect δ, and hence d(βin,(γout,δin))=1.

Let t be the closed curve which consists of [γout,x]γ, [βin,x]β and [γout,βin]c. We claim that t is a simple curve that is not crossed by any of α, β, and γ.

Consider first β and observe that it does not cross itself nor can it cross [γout,x]γ by the definition of x. From Proposition 6, it follows that βout(βin,αout)c and therefore β does not cross [γout,βin]c, and hence it does not cross t.

Next, consider γ and observe that it does not cross itself nor can it cross [γout,βin]c since it follows from Proposition 6 that γin(δin,γout)c. Therefore, t is a simple curve (recall that β and (γout,x)γ cannot intersect by the definition of x). Let T be the “triangular” region which is bounded by t and is to the right of γ (and to the left of β and c).

Returning to γ, it remains to show that it cannot intersect (βin,x)β. Suppose for contradiction that it does intersect (βin,x)β at a point y. Then either γ enters T at y or it leaves T at y. In the first case, following γ from y, it must leave T since the part of γ just before γout lies outside T. However, this means that γ must cross t and hence (βin,x)β at another point which is impossible since β and γ already intersect at x and y, see Figure 9(a).

(a) If γ enters T at y, then it must intersect (βin,x)β once more.
(b) If γ leaves T at y, then β enters T at x and must cross t at some other point.
Figure 9: Illustrations for the proof of Proposition 9: when following γ into the interior of c we meet β sooner than α at a point x. Suppose for contradiction that γ intersects [βin,x]β at another point y. Each pseudocircle’s label is placed within the digon-region associated with that pseudocircle.

Considering the second case, if γ leaves T at y, then it implies that γ enters T at x, which in turn implies that β is also entering T at x (otherwise β and γ would touch at x which is impossible), see Figure 9(b). However, following β from x, we would have to cross t since the part of β just before βin lies outside T. Since we have already observed that β does not cross t we conclude that γ does not cross t either.

We now show that α cannot intersect t. By the definition of x it cannot intersect [γout,x]γ. By Proposition 6 we have αin(βin,αout)c and it follows that α cannot intersect [γout,βin]c. Finally, if α crosses [βin,x]β, then it must cross it twice since α does not cross the other parts of t. The digon formed by α and β must lie outside of T since T lies outside the digon-region of β. Consequently, apart from its subarc that bounds this digon α is contained in T. However, this is impossible since then γ and α do not intersect.

We are now ready to show that δ cannot intersect [βin,x]β which would imply that d(βin,(γout,δin))=1. Assume to the contrary that δ intersects [βin,x]β. Notice that δin,δout,γout, and βin appear in this cyclic order on c. This follows from Proposition 6 and the assumptions of the claim. This implies that δ does not intersect [γout,βin]c. It follows that the two simple closed curves δ and t must either cross twice or four times, since crossing six times or more would imply that δ intersects γ or β more than twice. If δ and t cross four times, then δ crosses twice each of [βin,x]β and [γout,x]γ. Therefore, the only part of δ that is outside the digon-region of γ and the digon-region of β must be in T. The curves α and δ cannot cross in the digon-region of γ, because δ and γ form a digon. Similarly, α and δ cannot cross in the digon-region of β because α and β form a digon. Since α is disjoint from T we conclude that α and δ do not intersect which is a contradiction. We reach a similar contradiction in the case where δ crosses t precisely at two points that happen to be on [βin,x]β, once again α and δ cannot intersect.

It remains to consider the case where δ crosses [βin,x]β once and crosses [γout,x]γ once. The latter implies that either x or γout belong to the digon formed by δ and γ, which is impossible since neither β nor c intersects this digon.

Proposition 10.

If αout,γout,δin and βin appear in this cyclic order along c, then we have d(γout,(αout,βin))=d(δin,(αout,βin)).

Proof.

Orient γ and δ such that they enter the interior region of c at γout and δin, respectively. Recall that c is oriented counterclockwise and its interior region lies to its left. Thus, the digon-region of γ lies to its left whereas the digon-region of δ lies to its right. Let {A1,A2}=δα and {B1,B2}=δβ, such that the cyclic order of these four points along δ is A1,A2,B1,B2 (since α and β form a digon it follows from Proposition 6 that A1 and A2 must be consecutive and so are B1 and B2). Similarly, let {A1′′,A2′′}=γα and {B1′′,B2′′}=γβ, such that the cyclic order of these four points along γ is A1′′,A2′′,B1′′,B2′′.

Considering the cyclic order of A1,A2,A1′′ and A2′′ along α (under some orientation of α), it follows from Proposition 6 that the first two are consecutive and so are the last two (since γ and δ form a digon). Therefore, if we orient α such that A2 follows A1, then the cyclic order of those four points is either A1,A2,A1′′,A2′′ or A1,A2,A2′′,A1′′.

We claim that the former is impossible. Indeed, suppose that A1,A2,A1′′ and A2′′ appear in this cyclic order on α. Note that it follows from the cyclic order on δ (resp., γ) that both of B1 and B2 (resp., B1′′ and B2′′) must be in the same region (interior or exterior) of α. If B1,B2,B1′′ and B2′′ are in the exterior of α, then either [A1′′,A2′′]α or [A1,A2]α is contained in the intersection of the digon-regions of γ and δ (see Figure 10), which is impossible.

Figure 10: Suppose that A1,A2,A1′′,A2′′ appear in this cyclic order on α and B1,B2,B1′′ and B2′′ are in the exterior of α. Then the intersection of the digon-region of δ (which is to its right) and the digon-region of γ (which is to its left) contains either [A1′′,A2′′]α or [A1,A2]α which is impossible.

By a symmetric argument, it is impossible that B1,B2,B1′′, and B2′′ are in the interior of α. Therefore, either B1 and B2 are in the digon-region of α or B1′′ and B2′′ are there. However, this implies that the subarc of β in the digon-region of α intersects either γ or δ which is impossible since α and β form a digon.

Thus A1,A2,A2′′,A1′′ appear in this cyclic order on α, and similarly, B1,B2,B2′′,B1′′ appear in this cyclic order on β if it is oriented such that B2 immediately follows B1. Next, we redraw α close to the digon it forms with β such that these two pseudocircles become disjoint (see Figure 11). In a similar way, we redraw δ such that δ and γ become disjoint. Note that no other intersection points but αβ and γδ are destroyed and no new intersection points are introduced. Therefore, the vertex set of 𝒜({α,β,γ,δ}) is precisely {A1,A2,A1′′,A2′′,B1,B2,B1′′,B2′′} and its edge set consists of the edges [A1,A2]α, [A2,A2′′]α, [A2′′,A1′′]α, [A1′′,A1]α, [B1,B2]β, [B2,B2′′]β, [B2′′,B1′′]β, [B1′′,B1]β, [A1′′,A2′′]γ, [A2′′,B1′′]γ, [B1′′,B2′′]γ, [B2′′,A1′′]γ, [A1,A2]δ, [A2,B1]δ, [B1,B2]δ and [B2,A1]δ. It is not hard to see that this implies that the face set of 𝒜({α,β,γ,δ}) consists of four digons whose boundaries are {[A1,A2]α,[A1,A2]δ}, {[A1′′,A2′′]α,[A1′′,A2′′]γ}, {[B1,B2]β,[B1,B2]δ} and {[B1′′,B2′′]β,[B1′′,B2′′]γ}, and six faces of size four whose boundaries are (refer to Figure 11 for an illustration):
{[A1,A2]δ,[A2,A2′′]α,[A2′′,A1′′]γ,[A1′′,A1]α}, {[A1,A2]α,[A2,B1]δ,[B1,B2]β,[B2,A1]δ},
{[B1,B2]δ,[B2,B2′′]β,[B2′′,B1′′]γ,[B1′′,B1]β}, {[A1′′,A2′′]α,[A2′′,B1′′]γ,[B1′′,B2′′]β,[B2′′,A1′′]δ},
{[A1,A1′′]α,[A1′′,B2′′]γ,[B2′′,B2]β,[B2,A1]δ} and {[A2,A2′′]α,[A2′′,B1′′]γ,[B1′′,B1]β,[B1,A2]δ}.

Figure 11: 𝒜({α,β,γ,δ}) after redrawing α and δ such that they do not form digons with β and γ, respectively. If d(γout,(αout,βin))=2 and d(δin,(αout,βin))=1, then γout(A2′′,B2′′)γ and δin(B2,A2)δ.

Note that d(γout,(αout,βin))=1 and d(δin,(αout,βin))=2 iff γout(B2′′,A2′′)γ and δin(A2,B2)δ. Similarly, d(γout,(αout,βin))=2 and d(δin,(αout,βin))=1 iff γout(A2′′,B2′′)γ and δin(B2,A2)δ. Suppose for contradiction that one of these cases holds. Then, on the one hand, there is a curve, namely [γout,δin]c, which connects γout and δin while not crossing any of α, β, γ and δ (this follows from the given cyclic order and Proposition 6). However, on the other hand, there is no face of 𝒜({α,β,γ,δ}) whose boundary contains segments of both (B2′′,A2′′)γ and (A2,B2)δ or segments of both (A2′′,B2′′)γ and (B2,A2)δ, contradicting the existence of a curve as above.

This completes the proof of Theorem 2.

4 Concluding remarks

What can we say about drawings on other surfaces? For example, we can draw K7 on the torus, which implies the existence of 7 curves such that they pairwise form a digon, giving us 21 digons in total. This suggests that we need a significantly different approach since an argument based on the embeddability of the double cover would give roughly 2n as an upper bound.

Problem 11.

What is the maximum number of digons in a pairwise intersecting family of pseudocircles on a closed orientable connected surface Mg of genus g?

We note that graphs with planar bipartite double covers were extensively studied in topological graph theory, see for example the works of Negami [14, 15]. Negami also considered general covers of graphs and formulated the following nice conjecture:

Conjecture 12 (Negami 1988).

A graph G has a finite planar cover if and only if G embeds in the projective plane.

Indeed, with some extra work, one can show that digon graphs are embeddable in the projective plane, but we omit the proof.

Another natural question is to consider the number of triangles in intersecting pseudocircle arrangements. Felsner and Scheucher [9] showed that the maximal number of triangles is 2n2/3+O(n), and this is asymptotically tight. In their proof, they use the bound O(n) from [3] for the maximum number of digons in pairwise intersecting arrangements of pseudocircles. By applying Theorem 2 instead, we achieve the following improvement for simple arrangements.

Corollary 13.

Every simple arrangement of n4 pairwise intersecting pseudocircles has at most 23n2 triangles.

On the other hand, triangles are unavoidable, they showed that there are at least 2n/3 triangles and made the subsequent conjecture.

Conjecture 14.

Every pairwise intersecting arrangement of n3 pseudocircles has at least n1 triangles.

On a final remark, we were able to extend our proof of Theorem 2 to nontrivial pairwise intersecting arrangements of pseudocircles. However, it involves dealing with several delicate subcases. Therefore, we have chosen to omit the full proof here.

References

  • [1] E. Ackerman, G. Damásdi, B. Keszegh, R. Pinchasi, and R. Raffay. On the Number of Digons in Arrangements of Pairwise Intersecting Circles. In 40th International Symposium on Computational Geometry (SoCG 2024), pages 3:1–14, 2024. DOI: 10.4230/LIPIcs.SoCG.2024.3.
  • [2] E. Ackerman, G. Damásdi, B. Keszegh, R. Pinchasi, and R. Raffay. On the Number of Digons in Arrangements of Pairwise Intersecting Circles. Combinatorica, Submitted.
  • [3] P. Agarwal, E. Nevo, J. Pach, R. Pinchasi, M. Sharir, and S. Smorodinsky. Lenses in arrangements of pseudocircles and their applications. J. ACM, 51:139–186, 2004. DOI: 10.1145/972639.972641. doi:10.1145/972639.972641.
  • [4] N. Alon, H. Last, R. Pinchasi, and M. Sharir. On the complexity of arrangements of circles in the plane. Discrete and Computational Geometry, 26:465–492, 2001. doi:10.1007/S00454-001-0043-X.
  • [5] D. Archdeacon and K. Stor. Superthrackles. Australasian Journal of Combinatorics, 67(2):145–158, 2017. URL: http://ajc.maths.uq.edu.au/pdf/67/ajc_v67_p145.pdf.
  • [6] G. Cairns and Y. Nikolayevsky. Bounds for generalized thrackles. Discret. Comput. Geom., 23:191–206, 2000. doi:10.1007/PL00009495.
  • [7] P. Erdős. On sets of distances of n points. Amer. Math. Monthly, 53:248–250, 1946. doi:10.1080/00029890.1970.11992573.
  • [8] S. Felsner, S. Roch, and M. Scheucher. Arrangements of pseudocircles: On digons and triangles. In Int. Symp. on Graph Drawing and Network Visualization, volume 13764 of Lecture Notes in Computer Science. Springer, Cham, 2022. doi:10.1007/978-3-031-22203-0-32.
  • [9] S. Felsner and M. Scheucher. Arrangements of pseudocircles: Triangles and drawings. Discrete Comput. Geom., 65(1):261–278, 2021. doi:10.1007/S00454-020-00173-4.
  • [10] Jacob E. Goodman, Joseph O’Rourke, and Csaba D. Tóth, editors. Handbook of Discrete and Computational Geometry, Third Edition. Discrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton, FL, 2018. doi:10.1201/9781315119601.
  • [11] B. Grünbaum. Arrangements and Spreads, volume 10 of CBMS Regional Conference Series in Mathematics. AMS, 1972. doi:10.1090/cbms/010.
  • [12] M. Katchalski and H. Last. On geometric graphs with no two edges in convex position. Discrete Comput. Geom., 19(3):399–404, 1998. doi:10.1007/PL00009357.
  • [13] A. Marcus and G. Tardos. Intersection reverse sequences and geometric applications. J. Combin. Theory Ser. A, 113(4):675–691, 2006. doi:10.1016/J.JCTA.2005.07.002.
  • [14] S. Negami. Enumeration of projective-planar embeddings of graphs. Discrete Mathematics, 62:299–306, 1986. doi:10.1016/0012-365X(86)90217-7.
  • [15] S. Negami. Projective-planar graphs with even duals. Journal Of Graph Theory, 16:287–295, 1992. doi:10.1002/JGT.3190160402.
  • [16] R. Pinchasi. Gallai-Sylvester theorem for pairwise intersecting unit circles. Discrete and Computational Geometry, 28:607–624, 2002. doi:10.1007/S00454-002-2892-3.
  • [17] R. Pinchasi. Geometric graphs with no two parallel edges. Combinatorica, 28(1):127–130, 2008. doi:10.1007/S00493-008-2250-Z.
  • [18] R. Pinchasi. A note on lenses in arrangements of pairwise intersecting circles in the plane. Elec. J. of Comb, Submitted.
  • [19] R. Pinchasi and R. Radoičić. On the number of edges in a topological graph with no self-intersecting cycle of length 4. In Towards a Theory of Geometric Graphs, volume 342 of Contemp. Math., pages 233–243. Amer. Math. Soc., Providence, RI, 2004. doi:10.1090/conm/342/06143.
  • [20] W. Tutte. Toward a theory of crossing numbers. J. Comb. Theory, 8:45–53, 1970. doi:10.1016/s0021-9800(70)80007-2.
  • [21] P. Valtr. On geometric graphs with no k pairwise parallel edges. Discrete Comput. Geom., 19(3):461–469, 1998. doi:10.1007/PL00009364.