pith. sign in

arxiv: 2509.12354 · v3 · submitted 2025-09-15 · 🧮 math.CO

Toroidal Cartesian Products Where One Factor is 3-Connected

Elizabeth Badgett , Christian Millichap , Kenta Noguchi This is my paper

Pith reviewed 2026-05-18 15:33 UTC · model grok-4.3

classification 🧮 math.CO MSC 05C10
keywords toroidal embeddingCartesian product3-connected graphouter-cylindrical graphgraph genustorus
0
0 comments X

The pith

If G is 3-connected, then G □ H embeds on the torus exactly when G is outer-cylindrical and H is the path P₂.

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

The paper establishes that when one factor G in a Cartesian product is 3-connected, the product G □ H admits an embedding on the torus if and only if G is outer-cylindrical and H equals the path on two vertices. This matters because Cartesian products are basic ways to build larger graphs while preserving connectivity properties, so knowing the exact cases that fit on the torus clarifies which combinations stay at genus one. A reader interested in surfaces would see the result as pinning down the boundary between planar-like and higher-genus behavior for these products. The work also shows that the specific product K₄ □ P₃ instead requires genus two.

Core claim

If G is 3-connected, then the Cartesian product G □ H embeds on the torus if and only if G is outer-cylindrical and H is a path on two vertices, P₂. As a by-product of the proof, K₄ □ P₃ has genus two.

What carries the argument

The outer-cylindrical property of a 3-connected graph, meaning it admits a planar embedding on a cylinder with every vertex on one of the two boundary cycles; this property is used to construct the toroidal embedding or to derive a contradiction when it is absent.

If this is right

  • No 3-connected G that fails to be outer-cylindrical can form a toroidal Cartesian product with any H.
  • The only toroidal products involving a 3-connected factor are those where the second factor is exactly P₂.
  • K₄ □ P₃ does not embed on the torus and instead has genus two.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The characterization supplies a concrete test for toroidal embeddability that avoids constructing an embedding directly.
  • Similar restrictions may appear when studying the genus of Cartesian products on surfaces of genus greater than one.
  • The outer-cylindrical condition could be checked algorithmically for small 3-connected graphs to decide embeddability.

Load-bearing premise

The 3-connectedness of G must hold so that cycles and paths in G behave rigidly enough to limit the possible ways the product can be embedded on the torus.

What would settle it

A single 3-connected graph G that is not outer-cylindrical yet has G □ H embedding on the torus for some graph H, or an outer-cylindrical G whose product with an H other than P₂ still embeds on the torus.

read the original abstract

In this paper, we show that if $G$ is $3$-connected, then the Cartesian product of graphs $G \square H$ embeds on the torus if and only if $G$ is outer-cylindrical and $H$ is a path on two vertices, $P_2$. As a by-product of our work, we also show that $K_{4} \square P_{3}$ has genus two.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript proves that for any 3-connected graph G, the Cartesian product G □ H embeds on the torus if and only if G is outer-cylindrical and H ≅ P₂. As a byproduct, it shows that K₄ □ P₃ has genus two.

Significance. If the result holds, the paper supplies a clean if-and-only-if characterization of toroidal Cartesian products under the 3-connectedness hypothesis on one factor, together with an explicit genus calculation for the K₄ □ P₃ counter-example. These elements strengthen the necessity direction and provide concrete, falsifiable content that could be useful for classifying toroidal graph products.

minor comments (2)
  1. [Abstract] The abstract introduces the term 'outer-cylindrical' without a brief definition or forward reference; adding one sentence would improve accessibility for readers outside the immediate subfield.
  2. [Section on genus calculation] The genus calculation for K₄ □ P₃ is presented as a byproduct; a short dedicated subsection or remark clarifying how the toroidal non-embeddability of this case follows from the main theorem would make the logical flow clearer.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, including the recognition of the clean if-and-only-if characterization for toroidal Cartesian products under the 3-connectedness hypothesis and the explicit genus result for K₄ □ P₃. We appreciate the recommendation for minor revision.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper states a precise if-and-only-if characterization for toroidal embeddings of G □ H when G is 3-connected: this holds exactly when G is outer-cylindrical and H ≅ P₂, with an explicit genus-2 calculation supplied for the K₄ □ P₃ counter-example. The 3-connectedness hypothesis is used to constrain possible embeddings and rule out other factors H, but this is an external assumption rather than a self-referential definition or fitted input. No equations, ansatzes, or uniqueness claims are shown to reduce by construction to the target result itself, and the manuscript is described as supplying independent arguments for both directions. The central claim therefore does not collapse to its inputs or to a self-citation chain.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The result rests on standard definitions of 3-connectivity, Cartesian product, toroidal embedding, and outer-cylindrical graphs; no free parameters or new invented entities are visible in the abstract.

axioms (1)
  • standard math Standard definitions of graph connectivity, Cartesian product, and surface embeddings from prior literature.
    Invoked implicitly in the statement of the main theorem.

pith-pipeline@v0.9.0 · 5591 in / 1112 out tokens · 43683 ms · 2026-05-18T15:33:28.834912+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

22 extracted references · 22 canonical work pages

  1. [1]

    Nicholas Abell, Elizabeth McDermott, and Christian Millichap,Projective planar cartesian products of graphs, (2025), arXiv:2509.10261

    work page arXiv 2025

  2. [2]

    Paul Bonnington, Nathaniel Dean, Nora Hartsfield, and Katherine Scott,Obstruc- tion sets for outer-cylindrical graphs, J

    Dan Archdeacon, C. Paul Bonnington, Nathaniel Dean, Nora Hartsfield, and Katherine Scott,Obstruc- tion sets for outer-cylindrical graphs, J. Graph Theory38(2001), no. 1, 42–64

    work page 2001

  3. [3]

    Dan Steven Archdeacon,A KURATOWSKI THEOREM FOR THE PROJECTIVE PLANE, ProQuest LLC, Ann Arbor, MI, 1980, Thesis (Ph.D.)–The Ohio State University

    work page 1980

  4. [4]

    Behzad and S

    M. Behzad and S. E. Mahmoodian,On topological invariants of the product of graphs, Canad. Math. Bull.12(1969), 157–166

    work page 1969

  5. [5]

    Brin and Craig C

    Matthew G. Brin and Craig C. Squier,On the genus of Z 3 ×Z 3 ×Z 3, European J. Combin.9(1988), no. 5, 431–443

    work page 1988

  6. [6]

    Gross and Thomas W

    Jonathan L. Gross and Thomas W. Tucker,Topological graph theory, Dover Publications, Inc., Mineola, NY , 2001, Reprint of the 1987 original [Wiley, New York; MR0898434 (88h:05034)] with a new preface and supplementary bibliography

    work page 2001

  7. [7]

    Rall,Topics in graph theory, A K Peters, Ltd., Wellesley, MA, 2008, Graphs and their Cartesian product

    Wilfried Imrich, Sandi Klavˇzar, and Douglas F. Rall,Topics in graph theory, A K Peters, Ltd., Wellesley, MA, 2008, Graphs and their Cartesian product

    work page 2008

  8. [8]

    Math.15(1930), 271– 283

    Casimir Kuratowski,Sur le probl `eme des courbes gauches en topologie, Fund. Math.15(1930), 271– 283

    work page 1930

  9. [9]

    Sofia Fac

    Nikola Martinov,Uncontractable4-connected graphs, Annuaire Univ. Sofia Fac. Phys.74(1980), 61– 65

    work page 1980

  10. [10]

    3, Paper No

    Christian Millichap and Fabian Salinas,Embedding grid graphs on surfaces, Graphs Combin.38(2022), no. 3, Paper No. 87, 22

    work page 2022

  11. [11]

    White,Embeddings of Cartesian products of nearly bi- partite graphs, J

    Bojan Mohar, Toma ˇz Pisanski, and Arthur T. White,Embeddings of Cartesian products of nearly bi- partite graphs, J. Graph Theory14(1990), no. 3, 301–310

    work page 1990

  12. [12]

    Wendy Myrvold and Jennifer Woodcock,A large set of torus obstructions and how they were discovered, Electron. J. Combin.25(2018), no. 1, Paper No. 1.16, 17

    work page 2018

  13. [13]

    Graph Theory4(1980), no

    Toma ˇz Pisanski,Genus of Cartesian products of regular bipartite graphs, J. Graph Theory4(1980), no. 1, 31–42

    work page 1980

  14. [14]

    Graph Theory6(1982), no

    ,Nonorientable genus of Cartesian products of regular graphs, J. Graph Theory6(1982), no. 4, 391–402. 19

    work page 1982

  15. [15]

    109, 1992, Algebraic graph theory (Leibnitz, 1989), pp

    ,Orientable quadrilateral embeddings of products of graphs, vol. 109, 1992, Algebraic graph theory (Leibnitz, 1989), pp. 203–205

    work page 1992

  16. [16]

    Neil Robertson and P. D. Seymour,Graph minors. XX. Wagner’s conjecture, J. Combin. Theory Ser. B 92(2004), no. 2, 325–357

    work page 2004

  17. [17]

    Combin.110(2023), Paper No

    Timothy Sun,Settling the genus of the n-prism, European J. Combin.110(2023), Paper No. 103667, 12

    work page 2023

  18. [18]

    Tutte,A theory of 3-connected graphs, Indag

    W.T. Tutte,A theory of 3-connected graphs, Indag. Math23(1961), 441–455

    work page 1961

  19. [19]

    Wagner, ¨uber eine Eigenschaft der ebenen Komplexe, Math

    K. Wagner, ¨uber eine Eigenschaft der ebenen Komplexe, Math. Ann.114(1937), no. 1, 570–590

    work page 1937

  20. [20]

    White,The genus of repeated cartesian products of bipartite graphs, Trans

    Arthur T. White,The genus of repeated cartesian products of bipartite graphs, Trans. Amer. Math. Soc. 151(1970), 393–404

    work page 1970

  21. [21]

    Combinatorial Theory Ser

    ,The genus of the Cartesian product of two graphs, J. Combinatorial Theory Ser. B11(1971), 89–94

    work page 1971

  22. [22]

    J. W. T. Youngs,Minimal imbeddings and the genus of a graph, J. Math. Mech.12(1963), 303–315. DEPARTMENT OFMATHEMATICS, FURMANUNIVERSITY, GREENVILLE, SC 29613 Email address:beppybadgett@gmail.com DEPARTMENT OFMATHEMATICS, FURMANUNIVERSITY, GREENVILLE, SC 29613 Email address:christian.millichap@furman.edu 20

    work page 1963