1. Introduction
The study of combinatorial constraints in geometric and topological settings is a classical theme connecting discrete mathematics, graph theory, and topology. In particular, Ramsey theory provides a fundamental framework for understanding the inevitability of certain substructures in sufficiently large or richly connected systems [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12]. In parallel, the Jordan curve theorem offers a foundational topological insight: any simple closed curve in the plane partitions the plane into two complementary regions, an interior and an exterior, each of which is connected and uniquely determined by the curve [
13,
14,
15,
16,
17,
18]. Hales emphasized that although the statement is intuitively obvious, the rigorous proof is non-trivial, and the theorem has become a milestone in the pursuit of mathematical rigor [
14]. Today, the Jordan curve theorem is considered fully proved, both mathematically and formally [
14].
This work explores the intersection of these two domains. Specifically, we investigate how the Jordan curve theorem naturally induces a canonical two- or three-coloring of arcs connecting points located on a Jordan curve, or, more generally, on Jordan surfaces in higher dimensions. By classifying each connecting arc according to whether it lies entirely within the interior, the exterior, or on the boundary of the curve or surface, we obtain a well-defined colored complete graph on the vertex set of points [
3,
4]. The combinatorial constraints imposed by classical Ramsey numbers then guarantee the existence of monochromatic subgraphs—most notably, triangles in the two-color case and, more generally, in three-color extensions [
3,
4].
The central reason for combining Ramsey theory with the Jordan curve theorem is that topological separation induces a canonical and deformation-invariant coloring. A Jordan curve is a codimension-one boundary that partitions the ambient space into two uniquely defined connected regions—interior and exterior. Any arc connecting two boundary points must lie entirely in exactly one of these regions (or on the boundary itself), and this dichotomy provides a natural, intrinsic coloring of edges that is independent of geometry, metric, or embedding details. Once such a canonical coloring is present, Ramsey theory applies automatically, forcing the existence of monochromatic substructures that are, therefore, topological invariants.
We establish that these monochromatic configurations are topologically invariant: they persist under arbitrary homeomorphisms of the ambient space, reflecting intrinsic properties of the embedding rather than geometric specifics [
19]. This invariance extends naturally to higher-dimensional analogues via the Jordan–Brouwer separation theorem, where surfaces and hypersurfaces replace planar curves, and connecting arcs may traverse interior, exterior, or boundary regions.
By formalizing this framework, we reveal a general principle: codimension-one separation, combined with Ramsey-type combinatorial reasoning, imposes unavoidable structural constraints on systems of connecting arcs. This provides a foundation for understanding topologically constrained networks, geodesic configurations, and other spatial systems where connectivity and separation interact under robust combinatorial rules.
The paper is organized as follows. In
Section 2.1, we introduce the basic topological–combinatorial construction for arcs connecting points on a Jordan curve and define the canonical bi-coloring induced by the interior–exterior separation. Using this framework, we prove in
Section 2.1 that any configuration of six points on a Jordan curve necessarily contains a monochromatic triangle, in accordance with the classical Ramsey number
.
Section 2.2 establishes that this Ramsey property is invariant under arbitrary plane homeomorphisms, showing that the appearance of monochromatic triangles is a purely topological feature independent of geometric realization. In
Section 2.3, we apply the framework to geodesic connections between boundary points and derive a Ramsey-type constraint for geodesic networks constrained by a Jordan curve.
Section 2.4 extends the construction to a three-coloring by including boundary arcs and invokes the classical result
to guarantee the existence of monochromatic triangles for sufficiently large point sets.
Section 2.5 generalizes the approach to three and higher dimensions using the Jordan–Brouwer separation theorem, yielding analogous Ramsey constraints for arcs connecting points on Jordan surfaces and hypersurfaces.
Section 2.6 addresses infinite point sets on a Jordan curve and applies the infinite Ramsey theorem to prove the existence of infinite monochromatic cliques, which are, again, shown to be topological invariants.
2. Results
2.1. Ramsey Theorem for Arcs Connecting Points Located on the Jordan Curves
Consider the Jordan curve
depicted in
Figure 1, where
denotes the Euclidean plane—the set of all ordered pairs of real numbers:
, which is the standard two-dimensional real coordinate space, equipped with the usual Euclidean topology and geometry. Curve
divides the plane into two regions: the interior (denoted
in
Figure 1), bounded by the curve, and an unbounded exterior (denoted
in
Figure 1), containing all of the nearby and far away exterior points. Consequently,
.
We consider two points belonging to Jordan curve
, denoted, respectively, “1” and “2” (see
Figure 1). We propose to connect these points with two kinds of pathways/arcs. The interior open arc, denoted
, is a continuous path whose endpoints lie on the curve,
and whose interior lies entirely in the bounded region
Int(
Λ); hence,
is correct (see
Figure 1). These pathways are colored with gold (see
Figure 1). The exterior open arc, denoted
, is a continuous path whose endpoints lie on the curve,
and whose interior lies entirely in the unbounded region
Ext(
Λ); thus,
is correct (see
Figure 1). These pathways are colored with purple (see
Figure 1).
Consider that multiple interior and exterior arcs are possible. For a given unordered pair of points, we select one admissible connecting arc (interior-type or exterior-type).
Now consider three points located on the Jordan curve, depicted in
Figure 2. Pairs of points are connected with a single arc/edge, denoted
The arc is defined as follows:
. The edges/arcs are bi-colored. The interior open arc, denoted
, is a continuous path whose endpoints lie on the curve,
and whose interior lies entirely in the bounded region
Int(
Λ); hence,
is correct (see
Figure 2). These pathways are colored with gold (see
Figure 2). The exterior arc, denoted
, is a continuous path whose endpoints lie on the curve,
and whose interior lies entirely in the unbounded region
Ext Λ; thus,
is correct (see
Figure 2). These pathways/arcs are colored with purple (see
Figure 2).
The introduced coloring gives rise to the complete, bi-colored graph shown in
Figure 3.
Now consider six points located on the Jordan curve
. We connect the points with two kind of links/arcs. Pairs of points are connected with a single arc/edge denoted
The arc connecting the points is colored with gold when its interior belongs to the interior of the curve
; the arc connecting the points is colored with purple when its interior belongs to the exterior of the curve
. It should be emphasized that the relations “to be connected with the gold link” and “to be connected with the purple link” are not transitive [
11].
By the classical Ramsey theorem, as , every two-coloring of the edges of the complete graph on six vertices contains a monochromatic triangle. Therefore, in our configuration there exists at least one “triangle” whose three constituent arcs have the same color. In the following, we provide a formal mathematical proof of this theorem in the topological setting of arcs on the Jordan curve.
Axiom 1: Euclidian plane: is the Euclidean plane equipped with the standard Euclidean topology.
Axiom 2: Jordan curve.
A Jordan curve is a subset homeomorphic to the unit circle . By the Jordan curve theorem, such that , where and Ext are disjoint connected open sets.
Axiom 3: Let denote six distinct points on
Axiom 4: Connecting arcs. For every unordered pair of distinct points , there exists at least one simple continuous arc that either or . The endpoints of all the arcs lie on We define and , where is the set of all arcs whose interiors (excluding endpoints) lie entirely inside the interior region , and is the set of all arcs (excluding endpoints) that lie outside the Jordan curve, lying entirely in the unbounded exterior region Ext
Definition 1. Coloring function. Define a coloring function
by Theorem 1. Ramsey property on the Jordan curve. Let be a Jordan curve, and let
be six distinct points on
. For every coloring
it is true that:That is, every two-coloring of the six connecting arcs among six points on Λ yields a monochromatic triangle. The group theory example illustrating Theorem 1 is supplied in Appendix A. 2.2. Topological Invariance of the Introduced Coloring Scheme
Now consider topological properties of the introduced coloring scheme. Under any homeomorphism
h:
,
is a Jordan curve, and
defines the same coloring structure because
Hence, the existence of a monochromatic triangle is a topological invariant under plane homeomorphisms. Let us supply a formal proof to this.
Proof. Consider , which is a Jordan curve, with the interior Int(Λ) and exterior . are six distinct points. For each unordered pair there is a simple arc joining i and k and either or Arcs are colored. The coloring function is defined by Definition 1.
Let
be a homeomorphism and define
and
. Define the induced coloring
on
by the same rule (see Definition 1) applied to arcs between points of
(or equivalently by
We prove the following:
Because
h is a homeomorphism, it is a bijection with continuous inverse; thus, it maps open sets to open sets and connected sets to connected sets. By the Jordan curve theorem,
Int(
Λ) and
are the two complementary connected open components of
. Hence,
and
are complementary connected open components of
. Uniqueness of the two complementary components implies the following:
We prove that arcs and colors are preserved by
h. Let
be a simple arc with
. Consider the image arc
. This is a simple continuous arc joining
h(
i) and
h(
k). If
then, by Equation (2),
so,
for
. Likewise, if
, then, by Equation (2),
Therefore, the color of the edge
equals the color of the edge
; formally, we obtain
Now consider the image of a monochromatic triangle. Suppose
with
is a monochromatic triangle in (
V,
C), i.e., there exists coloring
, such that
Let
From Equation (6), we have for every
the following:
Thus,
A′ is a three-element subset of
V′, whose three edges are all colored
c, i.e., a monochromatic triangle in
. Conversely, as
is also a homeomorphism, the same argument with
shows that any monochromatic triangle in (
V′,
C′) pulls back to a monochromatic triangle in (
V,
C). Hence, the existence of a monochromatic triangle is equivalent for (
V,
C) and (
V′,
C′). □
We conclude that because a homeomorphism h: maps interiors to interiors and exteriors to exteriors, it preserves the classification of each connecting arc as interior-type or exterior-type. Therefore, the coloring induced by interior/exterior is preserved under h, and, consequently, the statement “there exists a monochromatic triangle among the six points on Λ” is invariant under any such h. Thus, Theorem 2 is proven:
Theorem 2. The existence of a monochromatic triangle in the bi-colored complete graph induced by the interior/exterior coloring of arcs on a Jordan curve Λ is invariant under every plane homeomorphism .
2.3. Jordan Curves, Ramsey Coloring, and Geodesic Lines
We now demonstrate a corollary that follows directly from the introduced approach. Consider three points
located on the Jordan curve
, as illustrated in
Figure 4. The points are connected with the geodesic arcs denoted
[
20]. If our Jordan curve
is embedded into the Euclidian plane, the geodesic arcs
are simply straight line segments, as shown in
Figure 4.
We impose the following restriction: geodesic arcs (with endpoints excluded) completely belong to the interior of the curve , or, alternatively, to the exterior of the curve . Obviously, this restriction may be frustrated. However, if this restriction is kept true, the following corollary immediately stems from Theorems 1 and 2.
Corollary 1. Let Λ be a Jordan curve, and let six distinct points be located on
. Connect each pair of points i, k with a geodesic arc
Assume that the interior of each geodesic arc
lies entirely either in the interior region Int(Λ) or in the exterior region Ext(Λ). Color
gold if it belongs to
and purple if it belongs to Ext(Λ). Then, every such two-coloring of the complete set of geodesic arcs among the six points on Λ contains a monochromatic triangle.
The corollary implies a universal combinatorial restriction on any geodesic network formed by six points on a Jordan curve, provided each geodesic lies entirely in either the interior or exterior of the curve (the imposed restriction is kept, namely, each geodesic arc lies entirely either in the interior region Int(Λ) or in the exterior region Ext(Λ)). Regardless of the specific geometry of the embedding (Euclidean, spherical, or Riemannian), the geodesic connection pattern cannot be arbitrary: a monochromatic triangle must necessarily appear. This establishes a Ramsey-type inevitability in geodesic configurations—a purely topological constraint independent of curvature or metric form. It means that any sufficiently connected system of geodesics on or around a closed boundary possesses a minimal region of local geometric coherence (the monochromatic triangle).
Now address the topological aspect of the corollary. Because the coloring (interior/exterior) is invariant under plane homeomorphisms, the corollary suggests that triples of mutually interior (or mutually exterior) geodesics represent topologically stable structures. Such monochromatic geodesic triangles can be viewed as minimal invariant configurations under continuous deformations of the curve. In geodesic theory, this corresponds to stable clusters of shortest paths or mutually non-intersecting minimal connections that persist under deformation.
From a metric geometry perspective, the corollary constrains how geodesic triangulations of regions bounded by Jordan curves can be formed. It guarantees the existence of a coherent triangular cell entirely contained either in the interior or exterior region, for arbitrary six points located on the Jordan curve.
2.4. Three-Colored Approach to the Points Located on the Jordan Curve
Consider the Jordan curve
depicted in
Figure 1 and the pair of points located on
. Now we propose to connect the points with three kinds of pathways/arcs. The interior of the first kind of pathway colored gold and denoted
belongs to the interior of the Jordan curve
, as shown in
Figure 1;
. The interior second kind of pathway/arc, which is colored purple, belongs to the exterior of the Jordan curve
E;
, and the third kind of the pathway colored black belongs to the Jordan curve itself,
. The endpoints of the arcs lie on the Jordan curve
This coloring gives rise to the triple-colored scheme, equivalent to the complete, triple-colored Ramsey graph, in which the points belonging to
are the vertices of the graph, and the edges are colored alternatively with black, gold, and purple according to the aforementioned coloring procedure. The Ramsey number
This result gives rise to the following theorem:
Theorem 3. Let Λ be a Jordan curve in the plane and let be a set of distinct points on For every unordered pair , assume that one selects exactly one connecting arc of one of the three types:
- (i)
an interior arc
(color the edge gold);
- (ii)
an exterior arc (color the edge purple);
- (iii)
a boundary arc (color the edge black).
Thus, every unordered pair
is assigned exactly one of three colors (gold, purple, black). If
, then the resulting three-colored complete graph on the vertex set S contains a monochromatic triangle. In other words, for any choice of 17 points on Λ and any admissible assignment of the three arc-types to each pair, there exist three indices,
, for which the three connecting arcs
all have the same type (all interior, all exterior, or all on Λ).
The statement is a direct translation of the classical Ramsey theorem for three colors: the Ramsey number so every three-coloring of the edges of the complete graph contains a monochromatic triangle. Our coloring produces a three-coloring of the complete graph on S (the color of edge is determined by which of the three arc-types was chosen). Therefore, for , a monochromatic triangle exists. It is noteworthy, that in contrast to gold and purple arcs, black arcs are unique for a given pair of the points on the given Jordan curve The extension to geodesic lines is obvious. Indeed, when geodesic lines , connecting 17 given points, which lie on the Jordan curve , and lie in the interior or exterior of or on the curve itself, the three-colored scheme may be introduced, and the appearance of the monochromatic triangle is inevitable.
2.5. 3D and nD Extension of the Suggested Approach
The introduced three-colored approach enables the 3D extension. Now we work in the Euclidean three-space:
Axiom 1. Euclidean space: .
Axiom 2. Jordan surface. A Jordan surface is a topological embedding of the two-sphere: . By the Jordan–Brouwer separation theorem, there exist two connected open sets: and , such that , with bounded and unbounded. The two regions are disjoint, with each having boundary of exactly . This is the 3D analogue of the Jordan curve theorem.
Axiom 3. Let vertex set be N distinct points lying on the Jordan surface
Axiom 4. Connecting arcs. For every unordered pair of distinct points , there exists at least one simple continuous arc , such that exactly one of the following holds:
(the interior path);
(the exterior path);
(the surface path). We define the three classes of paths
,
,
as the sets of simple arcs whose interiors lie entirely in
, and
, respectively. Now we define three-coloring:
Equivalently,
C is a map
.
Thus, the following extension of Theorem 3 emerges.
Theorem 4. Let be a Jordan surface and let be a set of 17 distinct points. For every choice of simple connecting arcs, as in Axiom 4 and the induced three-coloring defined by Equation (8), , there exists a monochromatic triangle: Because the coloring is purely combinatorial, the result reduces to the classical Ramsey theory for three colors. Theorem generalizes to every dimension
with the same simple reduction to classical Ramsey theory, provided we keep the same hypotheses (points lie on a hypersurface homeomorphic to a sphere and every pair of points is assigned one allowed connecting arc whose interior lies entirely in exactly one of the regions provided by Jordan–Brouwer theorem). The topology only determines the allowed types of edge; the combinatorial Ramsey conclusion then follows immediately. In contrast to the case of
, for
, black arcs are not unique for a given pair of the points. The extension for the bi-colored scheme applied to the n-dimension space is trivial and it is formulated as follows:
Let
be a Jordan surface and let
be a set of six distinct points. The points are connected with the arcs whose interiors belong to the exterior, or, alternatively, interior of the surface. Coloring function is defined in
Section 2.1. For every coloring
it is true that
.
2.6. Ramsey Approach to the Infinite Set of Points on the Jordan Curve
Let
be a Jordan curve, and let
be an infinite set of points. For any unordered pair
, assign a color according to the following rule: the edge
AB is colored gold if the interior of the arc connecting
A and
B lies entirely in the interior region
; the edge
AB is colored purple if the interior of the arc connecting
A and
B lies entirely in the exterior region
. The assignment of each pair to exactly one of the two colors is given by Axioms 1–4 of
Section 2.1, which guarantee the well-definedness of the interior/exterior arc classification. Then, according to the infinite Ramsey theorem, the complete graph
on the vertex set
X, with edges colored gold and purple, contains an infinite monochromatic clique. That is, there exists an infinite subset
such that all edges between points of
Y have the same color (either all gold or all purple).
Proof. By Axioms 1–4 of
Section 2.1, the construction described above yields a two-coloring:
of the complete graph on the infinite vertex set
X. The infinite Ramsey theorem states that for every infinite set
X and every two-coloring of its two-element subsets, there exists an infinite subset
Y ⊂
X such that all pairs
have the same color. Applying the infinite Ramsey theorem to the coloring
, we obtain an infinite subset
such that every pair of points in
Y is colored identically—either all gold or all purple. Thus,
is an infinite monochromatic clique embedded in the edge-colored graph determined by
Λ. □
Again, homeomorphisms preserve interior and exterior regions and they also preserve interior/exterior classification of arcs. Thus, the infinite monochromatic clique is carried to another infinite monochromatic clique. We conclude that is a topological invariant.
3. Discussion
The results presented in this work demonstrate that the classical Ramsey theorem, when combined with the topological structure imposed by the Jordan curve theorem, yields a family of universal combinatorial constraints on any system of arcs connecting points located on a Jordan curve or its higher-dimensional analogues. The crucial mechanism behind these constraints is that a Jordan curve Λ partitions the plane into two topologically distinguished regions, namely, its interior and exterior—which, in turn, define a natural and robust two-coloring of all connecting arcs.
These results reveal a general principle: the separation properties of codimension-one topological boundaries, i.e., subsets whose dimension is exactly one less than that of the ambient space and which partition the surrounding space into distinct regions. For example, a Jordan curve in the plane is a one-dimensional boundary separating the plane into interior and exterior regions, and a Jordan surface in three-dimensional space is a two-dimensional boundary separating space into interior and exterior. Such boundaries provide the topological mechanism by which connecting arcs can be classified as interior, exterior, or boundary-type, enabling the application of Ramsey-theoretic combinatorial constraints in a manner that is invariant under continuous deformations of the ambient space.
Theorem 1 shows that even in the simplest case of six points on Λ, the induced coloring must contain at least one monochromatic triangle. This statement is purely combinatorial, yet its applicability is purely topological: the conclusion depends neither on the geometric shape of Λ nor on the specific form of the connecting arcs, but only on the separation properties provided by the Jordan curve. Theorem 2 strengthens this conclusion by proving that the existence of such monochromatic triangles is invariant under arbitrary plane homeomorphisms, and therefore reflects an intrinsic topological feature of any arc-configuration on Λ.
The framework extends naturally in two directions. First, by allowing a third class of arcs—those lying on Λ itself—one obtains a three-coloring corresponding to three types of connectability (interior, exterior, boundary). Ramsey theory then forces the appearance of monochromatic triangles once the number of points reaches the classical threshold . Second, by replacing Jordan curves with Jordan surfaces (or more generally, Jordan–Brouwer hypersurfaces), the interior/exterior/surface classification persists in higher dimensions, enabling analogous results for arc systems in and . In all cases, the combinatorial Ramsey constraints survive because the topological separation properties are preserved under continuous deformations.
Finally, the infinite version of Ramsey’s theorem shows that for any infinite point set on Λ the interior/exterior coloring necessarily produces an infinite monochromatic clique. As homeomorphisms also preserve this structure, such cliques constitute stable, deformation-invariant combinatorial patterns within the arc-graph induced by Λ.
An important feature of the present framework is that it does not rely on any metric, differentiable, or smoothness assumptions. The arguments combine purely topological notions—continuity, connectedness, and separation, as guaranteed by the Jordan and Jordan–Brouwer theorems—with purely combinatorial Ramsey reasoning. In particular, the arcs connecting boundary points need not be smooth curves, and no notion of distance, curvature, or angle is required. This metric-independence significantly strengthens the universality of the approach and highlights its applicability to highly irregular, non-smooth, or abstract connectivity structures.
Overall, these results reveal that the interaction between codimension-one topological boundaries and combinatorial colorings gives rise to structurally unavoidable configurations—monochromatic triangles and infinite monochromatic subsets—that persist independently of geometric details. This suggests potential applications to geometric graph theory, topological network analysis, and the study of geodesic or minimal-path configurations constrained by closed boundaries.
We now discuss the limitations of the suggested framework. While the Ramsey–Jordan approach extends formally to higher dimensions via the Jordan–Brouwer separation theorem, an essential restriction must be emphasized. The construction relies crucially on codimension-one separation [
21,
22]. For boundaries of higher codimension, no canonical interior/exterior dichotomy exists, and the induced coloring scheme breaks down. To illustrate this point, consider a circle
. In contrast to a Jordan curve in the plane,
does not separate the ambient space: the complement
is connected. Consequently, there is no topologically defined notion of “interior” or “exterior,” and no canonical way to say that a path connecting two points on
lies on one side of the circle. Any arc joining two points on
can be continuously deformed into any other such arc without crossing
. As a result, there is no topologically distinguished partition of connecting arcs, and therefore no intrinsic two-coloring invariant under homeomorphisms. In this situation, the Ramsey–Jordan construction cannot be formulated in a canonical way and thus does not apply. This reflects the general topological fact that separation of the ambient space is a property unique to codimension-one embeddings.
4. Conclusions
In this work, we established a unified topological-combinatorial framework in which the Jordan curve theorem and classical Ramsey theory interact to produce universal structural constraints on arc-configurations supported on Jordan curves and their higher-dimensional analogues. By assigning colors to arcs according to whether they lie in the interior or exterior of a Jordan curve, we obtain a canonical bi-colored complete graph whose structure is independent of geometric details and determined solely by the topology of the embedding.
These results highlight a general principle: the separation properties of codimension-one topological boundaries, i.e., subsets whose dimension is exactly one less than that of the ambient space and which partition the surrounding space into distinct regions, govern the combinatorial constraints. For example, a Jordan curve in is a one-dimensional boundary separating the plane into interior and exterior regions, while a Jordan surface in is a two-dimensional boundary separating space into interior and exterior. The codimension-one property ensures that arcs connecting points can be consistently classified as interior-, exterior-, or boundary-type, enabling the application of Ramsey-theoretic reasoning in a topologically invariant manner. Arcs may be geodesic lines connecting the points located on the boundaries. Ramsey theorem imposes constraints on the networks formed by colored geodesic lines. Limitations of the suggested approach are discussed.
The finite Ramsey results show that any configuration of sufficiently many points on a Jordan curve necessarily contains monochromatic cycles—most notably, monochromatic triangles in the two-color setting of Theorem 1, and monochromatic triangles in the three-color extension governed by the classical number . The infinite version of Ramsey’s theorem guarantees the presence of infinite monochromatic cliques in any infinite point set on Λ. Crucially, we proved that these monochromatic configurations are invariant under all homeomorphisms of the plane: the interior/exterior arc-classification itself is a topological invariant; thus, the resulting Ramsey-forced structures inherit this invariance.
The framework extends naturally beyond the plane. By invoking the Jordan–Brouwer separation theorem, we showed that analogous colorings and Ramsey phenomena arise for arcs lying inside, outside, or on Jordan surfaces and hypersurfaces in higher dimensions. This demonstrates that the interplay between codimension-one separation topology and Ramsey theory is not restricted to curves but reflects a deeper combinatorial rigidity inherent to such embeddings. Codimension-one separation is crucial for the validity of the introduced approach.
Taken together, these results reveal a robust principle: whenever a codimension-one boundary partitions space into distinct regions, the induced colorings of connecting arcs inevitably contain universal Ramsey-type substructures that remain stable under continuous deformations. This principle opens promising avenues for applications in geometric graph theory, boundary-constrained networks, topological data analysis, and physical systems in which minimal or constrained paths interact with separating surfaces.