Pith. sign in

REVIEW 1 major objections 5 minor 30 references

Higher-dimensional generalization of Youngs' theorem and circular colorings

T0 review · 1 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read A single odd closed walk with torsion homology forces the 1-skeleton of any CW complex with even 2-skeleton to have circular chromatic number at least 2+2/(k−1), unifying three known generalizations of the projective-plane 3-color…

desk verdict A genuinely unifying generalization of Youngs' theorem, with a local and repairable gap in the key technical proof. read the letter →

arxiv 2505.23562 v3 pith:MMWKACI3 submitted 2025-05-29 math.CO math.AT

Kengo Enami , Takahiro Matsushita This is my paper
classification math.COmath.AT MSC 05C1505C10
keywords Youngs'theoremquadrangulationcircularchromaticnumberCWcomplexwitheven2-skeletonk-fundamentalgroupBorsukgraphtorsionhomologyprojectiveplane
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

The paper claims that a single topological condition—an odd closed walk whose integral homology class is torsion—forces a strong coloring lower bound on any graph that is the 1-skeleton of a CW complex with even 2-skeleton. Concretely, when every 2-cell is attached along an even cycle of length at most $2k$, the circular chromatic number of the 1-skeleton is at least $2+\frac{2}{k-1}$; when every 2-cell is attached along a 4-cycle, the 1-skeleton is not 3-chromatic. The authors show that this statement unifies the classical projective-plane quadrangulation theorem, its extension to non-orientable surfaces, the higher-dimensional projective-space analogue, and a circular-coloring refinement of the original result. A short argument using mod-2 homology proves the 3-chromatic case, while the full circular bound is proved through the $k$-fundamental group of a graph and a computation of the $k$-fundamental groups of Borsuk graphs.

What carries the argument

The $k$-fundamental group $\pi^k_1(G)$ of a based graph $(G,v)$ is the group of closed walks modulo $k$-homotopy: the equivalence relation generated by removing a backtrack and by identifying two walks of the same length that differ at fewer than $k$ positions. A theorem cited from earlier work of the second author identifies $\pi^k_1(G)$ with $\pi_1(X_k(G))$, where $X_k(G)$ is the 2-complex obtained from $G$ by attaching a disk along every even cycle $C_{2i}$ with $i\le k$. The matching computation is that the Borsuk graph $\operatorname{Bor}(S^1;r^{-1})$—whose vertices are points of the circle and whose edges join points at circular distance at least $r^{-1}$—satisfies $\pi^i_1(\operatorname{Bor}(S^1;r^{-1}))\cong\mathbb{Z}$ for $i\le k$ and $\cong\mathbb{Z}/2$ for $i>k$, with $k=\left\lceil\frac{2}{r-2}\right\rceil$. That computation is carried out with an auxiliary bipartite covering graph of the Borsuk graph whose own $k$-fundamental groups vanish, so the covering threshold becomes the group-theoretic threshold. These pieces let the proof read a circular coloring as a group homomorphism from $\pi^k_1(G)$ to $\mathbb{Z}$, forcing a torsion odd loop to land on zero and contradicting its required nontriviality.

What would settle it

Find a CW complex $X$ with quadrangulated 2-skeleton, an odd closed walk $\gamma$ whose integral homology class $[\gamma]_{\mathbb{Z}}$ is torsion in $H_1(X;\mathbb{Z})$, and a 3-coloring of $X^1$: Theorem 3.1 asserts such a coloring must contain a rainbow square on one of the attached 4-cycles, so examining the faces of a finite example would refute the theorem if no rainbow square appears. A second direct check is to find any graph $G$ for which $\pi^k_1(G)$ is not isomorphic to $\pi_1(X_k(G))$, which would break the transfer step of Theorem A.

Watch

Extended reading notes

Core claim

The central claim is Theorem A: let $X$ be a CW complex with even 2-skeleton, meaning $X^1$ is a simple graph and each 2-cell is attached along a graph homomorphism $C_{2i}\to X^1$; if each such attaching map satisfies $i\le k$ and some closed walk $\gamma$ of odd length in $X^1$ represents a torsion element $[\gamma]_{\mathbb{Z}}\in H_1(X;\mathbb{Z})$, then $\chi_c(X^1)\geq 2+\frac{2}{k-1}$. The paper derives from this a simpler 3-color obstruction (Theorem B): when all attaching maps are along $C_4$, the 1-skeleton is not 3-chromatic, proved by showing that any 3-coloring would force a rainbow square—a face whose four corners receive four distinct colors—on some attached 4-cycle. For the circular bound, the proof translates the torsion in $H_1(X;\mathbb{Z})$ into torsion in the abelianization of the $k$-fundamental group of $X^1$, then shows that a circular coloring below the claimed threshold would send that torsion element to zero in the $k$-fundamental group of a Borsuk graph, while an odd closed walk must remain nontrivial there.

Load-bearing premise

The circular-bound argument depends on the unproved-in-this-paper identification of the $k$-fundamental group of a graph with the ordinary fundamental group of the 2-complex obtained by filling all even cycles of length at most $2k$; all torsion transfer in the proof of Theorem A runs through that isomorphism, which is cited from the second author's earlier article [21].

Editorial extensions

If this is right

  • Every quadrangulation of the projective plane is not 3-chromatic, matching the original projective-plane theorem as the case of a quadrangulated 2-skeleton.
  • For a non-orientable closed surface, any quadrangulation with an odd cycle whose cutting yields an orientable surface is not 3-chromatic.
  • For every $d\ge 2$, every $d$-dimensional quadrangulation of the real projective space $\mathbb{RP}^d$ is not 3-chromatic.
  • For an even-sided embedding on $\mathbb{RP}^2$ with faces of length at most $2k$, the circular chromatic number is at least $2+\frac{2}{k-1}$.
  • For any CW structure of a lens space $L_m$ with $m$ divisible by 4 and quadrangulated 2-skeleton, the 1-skeleton is not 3-chromatic, a case where a previously proposed cohomological criterion does not apply.

Reading between the lines

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

  • A natural next step the paper does not take is to ask whether the bound $\chi_c(X^1)\ge 2+\frac{2}{k-1}$ is sharp for every $k$; equality would mirror the known extremal behavior of projective-plane quadrangulations.
  • The same $k$-fundamental-group method suggests modular versions: replacing integral torsion by torsion in $H_1(X;\mathbb{Z}_p)$ might yield lower bounds of the form $2+\frac{2}{p}$ for $p$-ary circular colorings, though the paper does not state such a result.
  • Because Theorem B has a short proof that avoids the $k$-fundamental group, a failure of the cited isomorphism in Theorem 4.1 would not immediately falsify the 3-chromatic obstruction, only the circular refinement as proved here.
  • The rainbow-square property highlighted in Theorem 3.1 is a finite combinatorial certificate: for any finite example, one can search for a 3-coloring with no rainbow square, making the theorem directly testable by computation.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

1 major / 5 minor

Summary. This paper proposes a common generalization of Youngs' theorem and several of its extensions. The main result, Theorem A, asserts that if X is a CW complex with even 2-skeleton and a bound k on the size of the 2-cell attaching cycles, and if an odd closed walk in X^1 represents a torsion class in H_1(X;Z), then the circular chromatic number of X^1 is at least 2 + 2/(k-1). Theorem B is the chromatic-number version for quadrangulated 2-skeleta. The proof of Theorem B uses a short Z_2-homology argument and is given in Section 3. The proof of Theorem A passes through k-fundamental groups and a computation of the k-fundamental groups of Borsuk graphs (Theorem 5.2). The paper also derives the k-fundamental groups of circular complete graphs in Proposition 5.10.

Significance. Theorems 1.2, 1.3, and 1.4 are known results of different flavors; a single theorem that recovers them is a useful unification. The paper is transparent about its reliance on the second author's earlier isomorphism theorem for k-fundamental groups and on the Cech-complex result of Adamaszek and Adams. The Section 3 proof of Theorem B is a clean and genuine simplification. The computation of π^k_1(Bor(S^1;r^{-1})) is a concrete new technical result that will be of independent interest. If the proof of Theorem 5.2 is repaired, the main theorem is credible.

major comments (1)
  1. [Section 5.2, proof of Theorem 5.2] The proof contains a false existence assertion and an invalid concatenation, and this is the key input for Theorem A. With a=r^{-1} and b=1/2-a, any walk of length 2k in the covering graph changes the first coordinate by at most 2kb = k(r-2)/r; for k=ceil(2/(r-2)) this quantity is strictly less than 1, so no walk δ of length 2k joins (0,1) to (1,1). For example, when r=3 and k=2, 2kb=2/3<1. The minimal even length is 2(k+1). The displayed concatenation δ·(f∘δ)···(f^{m-1}∘δ) is also ill-defined, since f(x,ε)=(x+1/2,-ε), so f∘δ does not begin at the terminal point of δ; the correct deck map is f^2. These two changes repair the proof: a closed walk of length 2(k+1) is trivial in π^i_1 for every i>k, and p remains a k-covering rather than a (k+1)-covering. The statement of Theorem 5.2 is not contradicted, but the proof as written does not establish it.
minor comments (5)
  1. [Section 5.2, Lemma 5.7] The hypothesis is written '0<a<2^{-1}'; it should be '0<a<1/2', and the notation should be made unambiguous.
  2. [Section 5.2, proof of Theorem 5.2] The terminal point of the lift is written '(m.1)'; it should be '(m,1)'.
  3. [Section 5.2, proof of Theorem 5.2] The sentence 'p∘δ is a closed walk of length 2k, and hence [δ]_i is trivial' should refer to [p∘δ]_i, not [δ]_i, since δ is not a closed walk.
  4. [Proposition 5.10] The map g:Bor(S^1;r^{-1})->K_{n/m} defined by g(x)=ceil(nx) mod n is not a graph homomorphism in general: for n=10,m=5, x=0 and y=0.501 give circular distance 0.501≥0.5 in S^1 but images 0 and 6 have distance 4<5 in Z/10. The usual retraction uses floor(nx) or a suitable rounding, and the proof should be corrected accordingly; this issue does not affect Theorem A.
  5. [Section 5.2, Theorem 5.8 and Corollary 5.9] The shift between the 'k' in Theorem 5.8 and the 'k' in Corollary 5.9 is easy to misread; the authors should state explicitly that the latter k is one less than the former.

Circularity Check

0 steps flagged · score 2.0 of 10

No circularity in the derivation: Theorem A is reduced to an in-paper computation of the k-fundamental group of Borsuk graphs (Theorem 5.2); the only load-bearing self-citation, Theorem 4.1 from [21], is independent published work, and the local flaw in the proof of Theorem 5.2 is a repairable correctness error, not a circular reduction.

full rationale

The derivation chain is not circular. Theorem A is proved by reducing to Theorem 5.3, which is a contrapositive: if chi_c(G) < 2 + 2/(k-1), then for some r < 2 + 2/(k-1) there is a homomorphism f : G -> Bor(S^1; r^{-1}); since 2/(r-2) > k-1, Theorem 5.2 gives pi_k^1(Bor(S^1; r^{-1})) =~ Z, so the torsion element [gamma]_k maps to 0 under f_*, while [f o gamma]_k is non-trivial by the parity homomorphism defined in-paper. The constant 2 + 2/(k-1) is the exact threshold of the Z versus Z/2 transition in Theorem 5.2, and that transition is computed in-paper: Theorem 5.8 shows p : gBor(S^1;a) -> Bor(S^1;a) is a (k-1)-covering but not a k-covering with k = ceil(1/(2b)), and Corollary 5.9 re-indexes via the arithmetic identity ceil(1/(2b)) = 1 + ceil(2/(r-2)). No parameter is fitted and no known result is renamed: Theorem A strictly generalizes Theorems 1.2-1.4, none of which appears as an input. The one load-bearing external input is Theorem 4.1 (Psi : pi_1^k(G) =~ pi_1(X_k(G))) cited from the second author's earlier paper [21]; it is published peer-reviewed work with stated assumptions that do not include the target bound, and the needed lifting lemmas (Proposition 4.7) are re-proved in the paper, so the citation is independent support and does not raise the circularity score. Theorem 4.2 appears only in Remark 5.4 as a consistency remark. For completeness, the proof of Theorem 5.2 (Section 5.2) contains a genuine local error that is a correctness issue, not a circularity: it asserts a walk delta of length 2k in gBor joining (0,1) to (1,1), but since each edge moves the first coordinate by at most b = 1/2 - a, the minimum even length is 2(k+1) (for r = 4, k = 1, b = 1/4, two steps reach at most 1/2 < 1); the displayed comparison tilde-gamma ~_i delta.(f o delta)... also uses the wrong deck transformation, since f o delta starts at (1/2,-1) rather than delta's endpoint (1,1), and the correct iterate is f^2. Both flaws are local and repairable (replace 2k by 2(k+1) and f by f^2), so the statement of Theorem A is not contradicted; this is weighed here only as a correctness risk, not as circularity.

Assumptions & free parameters 0 free parameters · 3 assumptions · 1 invented entities

The paper's central claim rests on standard algebraic topology and on the k-fundamental group framework from the second author's prior paper [21]. No free parameters are introduced. The only invented entity is the auxiliary covering graph gBor(S^1; a).

assumptions (3)
  • standard math Cellular homology and the Hurewicz theorem (Hatcher [11] Sections 2.2, 3.A, 2A.1)
    Used throughout for homology computations and the isomorphism H_1 =~ pi_1/comm in Section 3 and the proof of Theorem A.
  • domain assumption Theorem 4.1: pi^k_1(G) =~ pi_1(X_k(G))
    Cited from [21] (second author's prior work). This isomorphism connects the combinatorial k-fundamental group to the fundamental group of the CW complex X_k(G), and is load-bearing for the proof of Theorem A.
  • standard math Proposition 2.4 (cellular approximation, from Hatcher Corollary 4.12)
    Used to obtain the surjection pi_1(X') -> pi_1(X_k(G)) in the proof of Theorem A.
invented entities (1)
  • gBor(S^1; a)
    purpose: A bipartite graph with vertex set R x {±1} that serves as a universal cover-like object for computing the k-fundamental groups of the Borsuk graph Bor(S^1; a); it is defined in Section 5.2.
    This is a mathematical construction introduced for the proof, not an empirically testable entity. It is well-defined and used explicitly; no hidden postulation is involved.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Higher-dimensional generalization of Youngs' theorem and circular colorings." pith.science (2026). https://pith.science/paper/MMWKACI3

@misc{pith2026250523562,
  author       = {Pith},
  title        = {Pith review of: Higher-dimensional generalization of Youngs' theorem and circular colorings},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/MMWKACI3}},
  note         = {Machine review of arXiv:2505.23562}
}
read the original abstract

In 1996, Youngs proved that any quadrangulation of the real projective plane is not 3-chromatic. This result has been extended in various directions over the years, including to other non-orientable closed surfaces, higher-dimensional analogues of quadrangulations and circular colorings. In this paper, we provide a generalization which yields some of these extensions of Youngs' theorem.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

30 extracted references · 29 canonical work pages

  1. [1]

    Adamaszek and H

    M. Adamaszek and H. Adams. The Vietoris-Rips complexes of a circle. Pacific J. Math. , 290(1):1–40, 2017

    work page 2017

  2. [2]

    Appel and W

    K. Appel and W. Haken. Every planar map is four colorable. Bull. Amer. Math. Soc. , 82(5):711–712, 1976

    work page 1976

  3. [3]

    Appel and W

    K. Appel and W. Haken. Every planar map is four colorable. I. Discharging. Illinois J. Math. , 21(3):429– 490, 1977

    work page 1977

  4. [4]

    Appel and W

    K. Appel and W. Haken. Every planar map is four colorable. II. Reducibility. Illinois J. Math. , 21(3):491–567, 1977

    work page 1977

  5. [5]

    Archdeacon, J

    D. Archdeacon, J. Hutchinson, A. Nakamoto, S. Negami, and K. Ota. Chromatic numbers of quadran- gulations on closed surfaces. J. Graph Theory , 37(2):100–114, 2001

    work page 2001

  6. [6]

    Carlsson

    G. Carlsson. Topology and data. Bull. Amer. Math. Soc. (N.S.) , 46(2):255–308, 2009

    work page 2009

  7. [7]

    DeVos, L

    M. DeVos, L. Goddyn, B. Mohar, D. Vertigan, and X. Zhu. Coloring-flow duality of embedded graphs. Trans. Amer. Math. Soc. , 357(10):3993–4016, 2005

    work page 2005

  8. [8]

    Edelsbrunner and J

    H. Edelsbrunner and J. L. Harer. Computational topology. American Mathematical Society, Providence, RI, 2010. An introduction

    work page 2010

Show all 30 references
  1. [9]

    Godsil and G

    C. Godsil and G. Royle. Algebraic graph theory, volume 207 of Graduate Texts in Mathematics. Springer- Verlag, New York, 2001

    2001

  2. [10]

    Hachimori, A

    M. Hachimori, A. Nakamoto, and K. Ozeki. Coloring zonotopal quadrangulations of the projective space. European J. Combin., 125:Paper No. 104089, 15, 2025

    2025

  3. [11]

    A. Hatcher. Algebraic topology. Cambridge University Press, Cambridge, 2002

    2002

  4. [12]

    P. J. Heawood. Map-colour theorem. Proc. London Math. Soc. (2) , 51:161–175, 1949

    1949

  5. [13]

    Hell and J

    P. Hell and J. Ne˘ set˘ ril.Graphs and homomorphisms, volume 28 of Oxford Lecture Series in Mathematics and its Applications . Oxford University Press, Oxford, 2004

    2004

  6. [14]

    J. P. Hutchinson. On coloring maps made from Eulerian graphs. In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975) , volume No. XV of Congress. Numer. , pages 343–354. Utilitas Math., Winnipeg, MB, 1976

    1975

  7. [15]

    J. P. Hutchinson. Three-coloring graphs embedded on surfaces with all faces even-sided. J. Combin. Theory Ser. B , 65(1):139–155, 1995

    1995

  8. [16]

    Kaiser, O.-H

    T. Kaiser, O.-H. S. Lo, A. Nakamoto, Y. Nozaki, and K. Ozeki. Colouring normal quadrangulations of projective spaces. arXiv:2503.23057v1

    arXiv

  9. [17]

    Kaiser and M

    T. Kaiser and M. Stehl ´ ık. Colouring quadrangulations of projective spaces.J. Combin. Theory Ser. B , 113:1–17, 2015. 18 K. ENAMI AND T. MATSUSHITA

    2015

  10. [18]

    D. Kozlov. Combinatorial algebraic topology, volume 21 of Algorithms and Computation in Mathematics. Springer, Berlin, 2008

    2008

  11. [19]

    W. Liu, S. Lawrencenko, B. Chen, M. N. Ellingham, N. Hartsfield, H. Yang, D. Ye, and X. Zha. Quadrangular embeddings of complete graphs and the even map color theorem. J. Combin. Theory Ser. B , 139:1–26, 2019

    2019

  12. [20]

    Lov´ asz

    L. Lov´ asz. Kneser’s conjecture, chromatic number, and homotopy.J. Combin. Theory Ser. A, 25(3):319– 324, 1978

    1978

  13. [21]

    Matsushita

    T. Matsushita. Fundamental groups of neighborhood complexes. J. Math. Sci. Univ. Tokyo , 24(3):321– 353, 2017

    2017

  14. [22]

    Matsushita

    T. Matsushita. Hom complexes of graphs whose codomains are square-free, 2025. arXiv:2412.19144v2

    2025

  15. [23]

    Mohar and P

    B. Mohar and P. D. Seymour. Coloring locally bipartite graphs on surfaces. J. Combin. Theory Ser. B , 84(2):301–310, 2002

    2002

  16. [24]

    Pˆ echer and A

    A. Pˆ echer and A. K. Wagler. On circular-perfect graphs: a survey. European J. Combin., 91:Paper No. 103224, 17, 2021

    2021

  17. [25]

    Ringel and J

    G. Ringel and J. W. T. Youngs. Solution of the Heawood map-coloring problem. Proc. Nat. Acad. Sci. U.S.A., 60:438–445, 1968

    1968

  18. [26]

    Tardif and M

    C. Tardif and M. Wrochna. Hedetniemi’s conjecture and strongly multiplicative graphs. SIAM J. Dis- crete Math., 33(4):2218–2250, 2019

    2019

  19. [27]

    M. Wrochna. Square-free graphs are multiplicative. J. Combin. Theory Ser. B , 122:479–507, 2017

    2017

  20. [28]

    D. A. Youngs. 4-chromatic projective graphs. J. Graph Theory , 21(2):219–227, 1996

    1996

  21. [29]

    X. Zhu. Circular chromatic number: a survey. volume 229, pages 371–410. 2001. Combinatorics, graph theory, algorithms and applications

    2001

  22. [30]

    X. Zhu. Recent developments in circular colouring of graphs. In Topics in discrete mathematics , vol- ume 26 of Algorithms Combin., pages 497–550. Springer, Berlin, 2006. Department of Computer Science, College of Liberal Arts, Tsuda University, Kodaira, Tokyo 187-8577 Email a...

    2006

Pith tools

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