Pith. sign in

REVIEW 1 major objections 4 minor 18 references

Circle graphs and the automorphism group of the circle

T0 review · 1 major / 4 minor · reviewed 2026-08-10 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read This paper proves that the automorphism group of the circle graph—the intersection graph of all chords of the circle—is exactly the homeomorphism group of the circle.

desk verdict The universality and local-complementation results are solid and citable, but the main theorem's proof has a concrete gap in Lemma 3.1 that is not a minor typo. read the letter →

arxiv 2501.07698 v1 pith:R4IHNGS4 submitted 2025-01-13 math.CO math.GT

Agelos Georgakopoulos This is my paper · ORCID
classification math.COmath.GT MSC 05C6305C2505C1005C6205E18
keywords circlegraphautomorphismgrouphomeomorphismoftherationalstronglyuniversallocalcomplementationRadochordintersection
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper proves that the automorphism group of the circle graph is exactly the homeomorphism group of the circle, with the natural map $\pi$ sending each homeomorphism to its induced action on chords being an isomorphism. In other words, every symmetry of the combinatorial object formed by all chord intersections comes from a continuous symmetry of the circle itself. The same argument shows that the countable graph of rational chords has automorphism group equal to the homeomorphisms fixing the rational points. The paper further proves that this rational circle graph is a strongly universal countable circle graph (it contains every countable circle graph as an induced subgraph) and is invariant under local complementation, so it behaves like a canonical infinite representative of the whole circle-graph class.

What carries the argument

The workhorse is the boundary clique $K_x$, the set of all chords of $S^1$ incident with a given point $x$; these are maximal cliques of $C$, and distinct points give distinct boundary cliques. Lemma 3.1 proves that every automorphism of $C$ permutes these cliques, which converts a symmetry of an infinite graph into a symmetry of the underlying circle. Proposition 2.1 then supplies the conversion from a bijection preserving nestedness of pairs of points to a homeomorphism. For the rational subgraph, the density of the rationals lets arbitrary countable circle graphs be embedded by placing endpoints in cyclic order at rational points, and a blow-up construction eliminates shared endpoints so that local complementation can be realized by flipping one interval of the circle.

What would settle it

A concrete way to test Theorem 1.1 is to search for an automorphism of $C$ that maps three chords sharing a common endpoint on $S^1$ to three chords with no common endpoint; such a map would violate Lemma 3.1 and could be looked for by computing the intersection graph of a finite set of chords and checking whether any graph automorphism moves a boundary clique to a non-boundary clique.

Watch

Extended reading notes

Core claim

The central discovery is that the intersection pattern of all chords of the circle is a complete combinatorial shadow of the circle's homeomorphism group. Theorem 1.1 states that the canonical map $\pi$ from Aut($S^1$) onto Aut($C$) is an isomorphism; every automorphism of the chord graph is induced by a unique homeomorphism of $S^1$. The proof reconstructs the homeomorphism by first showing that any graph automorphism sends the maximal clique of chords through a point $x$ to the maximal clique of chords through some point $y$, then reading off a bijection of the circle and upgrading it to a homeomorphism via preservation of nestedness of pairs.

Load-bearing premise

The load-bearing premise is the geometric pigeonhole step in Lemma 3.1: after an automorphism maps two non-incident crossing chords to incident chords, two auxiliary chords lying in the same interval cut out by the image chords are claimed to force their connecting chord to avoid both boundary chords; if this fails for nested chords inside one cap, the proof that automorphisms preserve incident pairs collapses.

Editorial extensions

If this is right

  • The circle graph is a faithful combinatorial model of the full homeomorphism group of the circle.
  • The rational circle graph contains every countable circle graph as an induced subgraph, so it is a single countable host for all finite and countable chord-intersection graphs.
  • Local complementation never leaves the rational circle graph, so the graph is closed under the operation that generates vertex minors; consequently the finite forbidden-vertex-minor characterization extends to the countable setting.
  • Every automorphism of the rational circle graph is induced by a circle homeomorphism fixing the rational points, tying the graph's symmetry group to the arithmetic of the circle.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the proof recovers the homeomorphism from maximal cliques of incident chords, the same strategy may transfer to $d$-dimensional sphere graphs, where the analogue would be maximal cliques of hyperplane slices through a common boundary point; this is the open problem the paper raises for $d>1$.
  • The combination of strong universality and local-complementation invariance makes the rational circle graph a natural infinite litmus test for conjectural vertex-minor structure theories: any dichotomy conjectured for finite circle graphs can be checked against this one countable representative.
  • One could test how robust the theorem is by replacing the rationals with other dense proper subsets of the circle; the rational case gives the result for one such subset, and other choices would either extend the conclusion or reveal where the boundary-clique argument breaks.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 4 minor

Summary. The paper studies the circle graph C whose vertices are all chords of S^1 and whose edges join intersecting chords. The main result (Theorem 1.1) asserts that the natural map π from the homeomorphism group Aut(S^1) to Aut(C) is an isomorphism, i.e. every graph automorphism of C is induced by a circle homeomorphism. The proof proceeds through Lemma 3.1, which claims that every automorphism of C sends each boundary clique (all chords sharing a common endpoint) to a boundary clique. The paper also proves that the rational subgraph C_Q is strongly universal for countable circle graphs (Theorem 1.3) and is invariant under local complementation (Theorem 1.2), and that the Rado graph has this latter property (Observation 5.1).

Significance. If Theorem 1.1 is correct, it provides a natural and elegant analogue of Ivanov's theorem for the circle, identifying the automorphism group of a very concrete intersection graph with a classical topological group. The universality and local-complementation invariance of C_Q are also interesting, since such invariance is rare and connects to Bouchet's vertex-minor characterization. However, the proof of Theorem 1.1 rests entirely on Lemma 3.1, and the proof of that lemma contains a concrete geometric gap. Until that gap is repaired, the central claim is not established as written.

major comments (1)
  1. [§3, Lemma 3.1, proof of claim (2)] The pigeonhole step in the proof of (2) is invalid. After h(C) and h(D) are incident, the proof places four chords h(F_i) in the three intervals of S^1 \ (h(C) ∪ h(D)) and concludes that if h(F_i) and h(F_j) lie in the same interval, then any chord meeting both must meet h(C) or h(D). This is false: a chord whose endpoints both lie on the arc of that interval can cross two nested chords inside the cap without touching either boundary chord. For example, let h(C) have endpoints at angles 0° and 90° and h(D) have endpoints at 0° and 180°. Let h(F_1) have endpoints at 10° and 80°, and h(F_2) at 20° and 70°. The chord Z with endpoints at 50° and 85° intersects both h(F_1) and h(F_2) (its endpoints alternate with each pair in cyclic order), yet both endpoints of Z lie on the arc (0°,90°), so Z avoids both h(C) and h(D). Thus the claimed contradiction does not follow. Since claim (2) is the basis for preserving boundary cliques, and Lemma 3.1 is the basis for the surjectivity of π in Theorem 1.1, this is a load-bearing gap. The lemma may still be true, but the proof as written needs a substantially more careful argument to rule out this configuration.
minor comments (4)
  1. [§3, proof of Lemma 3.1] The phrase 'at least two of the h(Fi), ∈ [4]' contains a typo; it should read 'h(F_i), i ∈ [4]'.
  2. [§1, Introduction] 'Charactering' should be 'Characterizing'.
  3. [§6, reference [18]] The reference to a Wikipedia page is unusual for a published article; a standard textbook or survey reference on distance-hereditary graphs would be more appropriate.
  4. [§4, proof of Theorem 1.3] The recursive placement of the new endpoints p_j, q_j into Q1 is plausible but terse; an explicit statement of how to extend a given finite cyclic order of rational points by two new rational points using the density property (1) would help the reader.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the derivation of Theorem 1.1 rests on independent geometric facts, not on its own conclusion or on load-bearing self-citations.

full rationale

I walked the claimed derivation chain and found no step in which a result is equivalent to its input by construction, nor any load-bearing self-citation. Theorem 1.1 is proved by defining a map h' from the action of an automorphism h on boundary cliques and then invoking Proposition 2.1, whose cited ingredient is the external geometric fact from Coxeter that preserving nestedness of point pairs forces a homeomorphism; Proposition 2.1 is not derived from Theorem 1.1. Lemma 3.1 attempts to prove that automorphisms preserve boundary cliques by a standalone geometric pigeonhole argument about chords, not by assuming the target isomorphism. Even if the geometric inference in Lemma 3.1 is flawed, that is a correctness issue, not circularity: the proof does not reduce to its conclusion. The universality proof of Theorem 1.3 constructs rational realizations from the density of the rationals using only property (1). The local-complementation invariance proof of Theorem 1.2 constructs an auxiliary circle graph C' from CQ and verifies the flipped realization coincides with C' directly, without invoking Theorem 1.1. The self-citations [4] and [9] are peripheral background references about sphere graphs and universal elements, and they are not used to establish the main isomorphism or the universality of CQ. Observation 5.1 about the Rado graph is proved from the extension property. I therefore find no circularity and set the score to 0.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

No free parameters and no ad hoc entities. The proof introduces auxiliary graphs C' and functions o_q, but these are constructed from existing objects, not postulated new mathematical entities. The paper relies on standard theorems (nestedness-homeomorphism, order type of Q, Bouchet, Rado uniqueness) and on an informal geometric assertion in Lemma 3.1 that is not fully proved.

assumptions (5)
  • standard math A bijection of S1 preserving nestedness of pairs is a homeomorphism (Proposition 2.1, cited to [3]).
    Used to conclude that the map h' constructed in Theorem 1.1 is a homeomorphism.
  • standard math The order type of Q is determined by density and extends to cyclic orders on Q1.
    Used in Theorem 1.3 to embed endpoints of a countable circle graph into Q1 while preserving cyclic order.
  • standard math Bouchet's forbidden vertex-minor characterization of finite circle graphs.
    Used to extend the characterization to countable circle graphs via Observation 4.1; not load-bearing for the main theorem.
  • standard math Local complementation of a circle graph can be realized by flipping one of the intervals determined by a chord.
    Used in the proof of Theorem 1.2 to show that the blow-up graph C' is invariant under local complementation.
  • standard math The Rado graph is the unique countable graph with the extension property (4).
    Used in Observation 5.1 to prove that the Rado graph is invariant under local complementation; not needed for the main results.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Circle graphs and the automorphism group of the circle." pith.science (2026). https://pith.science/paper/R4IHNGS4

@misc{pith2026250107698,
  author       = {Pith},
  title        = {Pith review of: Circle graphs and the automorphism group of the circle},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/R4IHNGS4}},
  note         = {Machine review of arXiv:2501.07698}
}
abstract

We prove that $Aut({\mathbb S}^1)$ coincides with the automorphism group of the \emph{circle graph} $\mathcal{C}$, i.e. the intersection graph of the family of chords of ${\mathbb S}^1$. We prove that the countable subgraph of $\mathcal{C}$ induced by the rational chords is a strongly universal element of the family of circle graphs, and that it is invariant under local complementation. The only other known connected graphs that have the latter property are $K_2$ and the Rado graph.

Figures

Figures reproduced from arXiv: 2501.07698 by the authors.

Figure 1
Figure 1. A contradiction to mapping non-incident chords [PITH_FULL_IMAGE:figures/full_fig_p005_1.png] view at source ↗
Figure 2
Figure 2. Defining the injection oq in the proof of Theorem 1.2. natural ordering < induced by that of R, satisfy (1). Therefore, there is an order￾preserving bijection o : (Q ∩ (0, 1)) → I. We define C ′ from CQ by ‘blowing-up’ each q ∈ Q1 into o(q) ∩ Q, so that each chord in V (CQ) incident with q becomes incident with a distinct point in o(q), and intersections of chords are preserved. To achieve this, we start by choosing… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

18 extracted references · 17 canonical work pages

  1. [1]

    L. A. Beklaryan. Groups of homeomorphisms of the line and the circle. Topological characteristics and metric invariants. Russian Mathematical Surveys, 59(4):599, 2004

    work page 2004

  2. [2]

    A. Bouchet. Circle Graph Obstructions. J. Combin. Theory (Series B) , 60(1):107–144, 1994

    work page 1994

  3. [3]

    H. S. M. Coxeter. The Real Projective Plane, Third Edition . Springer, 1993

    work page 1993

  4. [4]

    Davies, A

    J. Davies, A. Georgakopoulos, M. Hatzel, and R. McCarty. Strongly sublin- ear separators and bounded asymptotic dimension for sphere intersection graphs. Submitted

    work page

  5. [5]

    de Groot

    J. de Groot. Groups represented by homeomorphism groups I. Math. Annalen, 138(1):80–102, 1959

    work page 1959

  6. [6]

    Graph Theory (6th edition)

    Reinhard Diestel. Graph Theory (6th edition). Springer-Verlag, 2025. Electronic edition available at: http://www.math.uni-hamburg.de/home/diestel/books/graph.theory

    work page 2025

  7. [7]

    Disarlo, T

    V. Disarlo, T. Koberda, and J. de la Nuez Gonz´ alez. The model theory of the curve graph. arXiv:2008.10490

    arXiv 2008

  8. [8]

    Dur´ an, L

    G. Dur´ an, L. N. Grippo, and M. D. Safe. Structural results on circular-arc graphs and circle graphs: A survey and the main open problems. Discrete Applied Mathematics, 164:427–443, 2014

    work page 2014

Show all 18 references
  1. [9]

    Georgakopoulos

    A. Georgakopoulos. On graph classes with minor-universal elements. J. Combin. Theory (Series B) , 170C:56–81, 2025

    2025

  2. [10]

    E. Ghys. Groups Acting on the Circle. L’Enseignement Math´ ematique, 47(3-4):329–407, 2001

    2001

  3. [11]

    N. V. Ivanov. Automorphism of complexes of curves and of Teichm¨ uller spaces. Int. Math. Res. Not. IMRN , 1997(14):651–666, 1997

    1997

  4. [12]

    N. V. Ivanov. Fifteen problems about the mapping class groups. In Prob- lems on mapping class groups and related topics, volume 74 of Proceedings of Symposia in Pure Mathematics , pages 71–80. AMS, 2006

    2006

  5. [13]

    Komjath and J

    P. Komjath and J. Pach. Universal elements and the complexity of certain classes of infinite graphs. Discrete Mathematics, 95(1):255–270, 1991

    1991

  6. [14]

    Groups of Circle Diffeomorphisms

    Andr´ es Navas. Groups of Circle Diffeomorphisms . Chicago Lectures in Mathematics. University of Chicago Press, Chicago, IL, 2011

    2011

  7. [15]

    R. McCarty. Local Structure for Vertex-Minors . PhD Thesis, UWSpace, 2021. 9

    2021

  8. [16]

    Robertson and P

    N. Robertson and P. D Seymour. Graph Minors: XVII. Taming a Vortex. J. Combin. Theory (Series B) , 77(1):162–210, 1999

    1999

  9. [17]

    Sabidussi

    G. Sabidussi. Graphs with Given Infinite Groups. Monatshefte f¨ ur Mathe- matik, 64:64–67, 1960

    1960

  10. [18]

    Distance-hereditary graph, October 2022

    Wikepedia. Distance-hereditary graph, October 2022. https://en.wikipedia.org/w/index.php?title=Distance-hereditary graph&oldid=1113519248 Page Version ID: 1113519248. 10

    2022

Pith tools

Reviewed August 10, 2026 · model on record in the stance chip above.