Pith. sign in

REVIEW 2 major objections 5 minor 1 cited by

Covering and labeling generalizations of the Borsuk-Ulam theorem

T0 review · 2 major / 5 minor · reviewed 2026-08-04 · 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 intersection patterns forced by the Borsuk–Ulam theorem are governed by Radon pairs of finite point sets, and extends that principle to continuous, colorful, parity, and product-sphere settings.

desk verdict A genuinely new and clean generalization of Fan's theorem (Theorem 1.2), but the continuous version (Theorem 2.5) has a real proof gap in the partition-of-unity step that the authors need to repair. read the letter →

arxiv 2509.07247 v1 pith:QDPOLWEL submitted 2025-09-08 math.CO math.GT

Florian Frick , Zoe Wellner This is my paper · ORCID
classification math.COmath.GT MSC 55M2052A3505C15
keywords Borsuk–UlamtheoremFan'slemmaRadonpartitionsspherecoveringstopologicalHallhamsandwichlocalchromaticnumbermass
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 generalizes Ky Fan's combinatorial version of the Borsuk–Ulam theorem. The central result, Theorem 1.2, says: whenever closed sets A_1,...,A_m on the d-sphere each miss their antipodal image and together with their antipodes cover the sphere, and whenever X={x_1,...,x_m} is any point set in R^{d-1}, there must be disjoint index sets S and T whose convex hulls intersect and whose corresponding intersections of A_i over S and -A_i over T also intersect. Fan's theorem is exactly the special case where X lies on the moment curve, so the alternating sign pattern is one order type among many. The same mechanism yields a continuous version replacing convex hulls by images of disjoint faces under a continuous map, a colorful version with d+1 separate coverings, and a parity strengthening of Fan's counting lemma. Applications include structural results for graph colorings, a new proof of the topological Hall theorem, and mass-partition statements that go beyond existence to prescribe which measures are pushed to which side of a hyperplane.

What carries the argument

The load-bearing object is Lemma 2.1: for X⊂R^{d-1}, write A^+={(x,1)} and B^-={(-x,-1)}; then conv A ∩ conv B ≠ ∅ if and only if 0∈conv(A^+∪B^-). This turns a convex-geometric Radon pair into a zero of an antipodally symmetric linear map on a triangulated sphere, so the Borsuk–Ulam theorem applies directly. For the continuous generalization, the analogous object is the antipodal map S^d→(Δ^{m-1})^{*2}_Δ built from a partition of unity subordinate to the projected covering; composing with the lifted continuous map converts an intersection of continuous images into an odd map whose zero is the desired point. Theorem 2.2 additionally uses degree: the relevant odd map has odd degree by Borsuk–U

What would settle it

Set d=2 and take X={x1,x2,x3,x4} with x4 strictly inside the triangle x1x2x3, so the unique Radon pair is {4} against {1,2,3}. Try to construct closed sets A1,...,A4⊂S^2 with A_i∩(-A_i)=∅ and ∪(A_i∪(-A_i))=S^2 but with A_4∩(-A_1∩-A_2∩-A_3)=∅. Theorem 1.2 says no such covering exists; an explicit covering or a computational search showing one exists would refute it.

Watch

Extended reading notes

Core claim

The paper establishes a transfer principle: Radon-type intersection combinatorics in Euclidean space constrain the intersection combinatorics of antipodal sphere coverings, and hence of every Borsuk–Ulam-type construction. The proof reduces the geometry to an odd map: lift each point x_i to (x_i,1) and each antipode to (-x_i,-1), label a sufficiently fine antipodal triangulation of the sphere with these points, invoke the Borsuk–Ulam theorem to get a zero, then let the triangulation mesh go to zero. A zero of the labeled map is equivalent to a Radon pair for X, so the limit produces disjoint faces S,T whose convex hulls intersect and whose corresponding covering sets intersect. The paper als

Load-bearing premise

The load-bearing premise is that the covering sets can be approximated by arbitrarily fine antipodal triangulations while A_i and -A_i stay separated by a positive margin, so each vertex gets an unambiguous label and the zero of the limiting odd map survives; the product-sphere variant inherits the additional restriction that the underlying non-existence result is only proven when d is a power of two.

Editorial extensions

If this is right

  • Every order type of m points in R^{d-1} produces its own Fan-type covering theorem; Fan's alternating pattern is the special case of points on the moment curve, so the family of such results is much larger than the classical one.
  • For generic odd labelings of antipodal triangulations, not only does a zero-capturing facet exist, but the number of such facets is exactly twice an odd number, extending Fan's parity statement.
  • Proper colorings of graphs whose chromatic number is bounded via Borsuk–Ulam must contain forced rainbow structures: with enough colors, some complete bipartite subgraph has color sets on its two sides forming a Radon pair, yielding local-chromatic-number bounds.
  • The topological Hall theorem and hypergraph Hall-type results on systems of disjoint representatives follow as special cases of the rainbow-face version, giving structural statements about matchings beyond the classical dimension threshold.
  • For more than d masses in R^d, there exists a hyperplane that simultaneously places the measures indexed by one side of a Radon pair on opposite sides of itself; the (Z/2)^2 product-sphere version gives an analogous two-hyperplane chessboard partition when d is a power of two.

Reading between the lines

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

  • The Fan-complex discussion in Section 7 suggests that the full set of Radon pairs is not merely sufficient but essentially necessary: if a single minimal Radon pair is deleted, the pattern is no longer forced.
  • Because the main proof is constructive at positive mesh size and passes to the limit by compactness, the corresponding search problems plausibly inherit membership in PPA; the parity theorem may provide a second witness beyond the existence of an intersection.
  • The colorful setup of Theorem 2.6 appears ripe for iteration: combining it with other point configurations should yield colorful KKM, Komiya, and ham-sandwich consequences for every order type, not only the cyclic ones.
  • The product-sphere theorem is proved only for d a power of two; a natural test is whether this restriction is genuinely necessary for the structural conclusion or an artifact of the known obstruction.
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

2 major / 5 minor

Summary. The paper proves several generalizations of Ky Fan's combinatorial labeling theorem, which itself generalizes Borsuk–Ulam. Theorem 1.2 asserts that for a point set X={x_1,...,x_m} in R^{d-1} and an antipodal closed cover A_1,...,A_m,-A_1,...,-A_m of S^d with A_i∩(-A_i)=∅, there is a Radon pair (S,T) for X such that ∩_{i∈S} A_i ∩ ∩_{i∈T} (-A_i) is nonempty. This is proved by a short reduction to Borsuk-Ulam via a Radon lemma and a limiting argument. Theorem 2.2 gives a parity statement for generic odd labelings of antipodal triangulations; Theorem 2.5 replaces convex hulls by continuous images h(σ),h(τ) of faces of the simplex; Theorem 2.6 gives a colorful extension. The paper then develops applications to sphere coverings, non-embeddability, Kneser colorings, rainbow faces, the topological Hall theorem, hypergraph Hall theorems, ham-sandwich-type mass partition results, and a (Z/2)^2-equivariant product-sphere version. The central claim is that the sign/combinatorial patterns in Fan-type results are governed by order types of point sets, or more generally by intersection combinatorics of continuous images.

Significance. If the results hold, this is a substantial and useful unification: it shows that the classical alternating-sign pattern in Fan's theorem is just one order type of m points in R^{d-1}, and that every Radon-type intersection pattern yields a Fan-type covering theorem. The proof of Theorem 1.2 is elegant and genuinely short, reducing directly to Borsuk-Ulam through the standard Radon lemma. The colorful versions and the applications to topological Hall theorems and mass partitions give the paper broad reach. The paper is also honest about its dependence on prior work in special cases and on Ramos's theorem for powers of two in the product-sphere section. The main weakness is a concrete gap in the proof of Theorem 2.5, which is one of the advertised main extensions and is used in later sections; this requires repair before the paper can be accepted. The remainder of the core theorems are mostly standard and sound modulo local details.

major comments (2)
  1. [§2, proof of Theorem 2.5] The proof requires a continuous partition of unity α_i: RP^d→[0,1] with α_i(x)>0 only when x∈q(A_i), citing [59]. Partitions of unity are normally subordinate to open covers, and for a closed cover such a partition need not exist. Concrete example: on S^1 (angles modulo 2π) take 0<a<π/2 and closed arcs A_1={0}, A_2=[0,a], A_3=[-a,0], A_4=[a,π-a]. These satisfy A_i∩(-A_i)=∅ and ∪(A_i∪-A_i)=S^1. In RP^1 the point 0 lies in q(A_1) and is an endpoint of both q(A_2) and q(A_3). Any continuous α_i positive at 0 would be positive in a full neighborhood of 0, but every such neighborhood contains points outside q(A_i); hence α_i(0)=0 for all i, contradicting ∑α_i=1. Thus the proof of Theorem 2.5 does not go through. Since Theorem 2.5 is used in §3.2 and in Theorem 7.1, this is a load-bearing gap. The theorem may well be true and repairable by a triangulation/limiting argument along the lines of T
  2. [§4.1, proof of Lemma 4.9] The proof asserts that for a signed label set eA with |a| set A, Σ[f^{-1}(A)] is isomorphic to Λ(Σ,f)[ e f^{-1}(eA)]. This is false when eA contains both positive and negative signs. In that case the induced subcomplex is the join of the subcomplexes on the positive-sign and negative-sign labels, not the single complex Σ[f^{-1}(A)]. The connectivity needed for the skeleton extension still follows from the join connectivity theorem, so the statement is repairable, but as written the proof of Lemma 4.9 has an incorrect step. Since this lemma is the route to the claimed new proof of the topological Hall theorem (Theorem 4.4), the gap should be fixed.
minor comments (5)
  1. [§2, Theorem 2.6 proof] The indexing is off by one: vertices of the barycentric subdivision correspond to faces of dimensions 0,...,d, but the sets X^{(j)} and A^{(j)}_i are indexed by j∈[d+1]. The proof writes f(v_σ)=(x^{(dim σ)}_i,1); this should be dim σ+1 (or the index set should be {0,...,d}).
  2. [§3.3, Corollary 3.7] In the definition of A_i, the expression max_{j∈[m]} |f_j(x0)| uses x0 before it is introduced; it should be max_{j∈[m]} |f_j(x)|.
  3. [§2, Remark 2.7] The two items in Remark 2.7 are both numbered (1); the second should be (2).
  4. [§2, Theorem 2.2 proof] The degree argument is terse: e f is defined as a map to R^{d+1}, not to S^d. The proof should explicitly normalize to S^d (the map is nonzero) and justify that the preimage of e_{d+1} is finite before summing local degrees. This is standard and fixable, but as written it jumps a step.
  5. [§6] The proof of Theorem 6.2 assumes the existence of arbitrarily fine (Z/2)^2-symmetric triangulations of S^d×S^{d-1} with small facets. This is plausible and standard, but a one-sentence justification or reference would improve clarity.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: main theorems reduce to external Borsuk–Ulam theorem; self-citations are not load-bearing.

full rationale

The derivation chain is self-contained modulo the classical Borsuk–Ulam theorem. Theorem 1.2 is proved by choosing a fine antipodal triangulation, assigning vertex labels from the point configuration X with sign pattern determined by the cover, linearly extending to an odd map, and applying Borsuk–Ulam to obtain a zero; Lemma 2.1 then translates the zero into a Radon pair and the desired set intersection. The limiting argument uses only compactness and closedness of the A_i. Theorem 2.2 uses the standard Borsuk–Ulam fact that an odd map S^d -> S^d has odd degree; Theorem 2.5 and Theorem 2.6 similarly reduce to Borsuk–Ulam with auxiliary constructions (partitions of unity, barycentric subdivision). The applications in Sections 3–6 are deductions from these theorems together with standard external results such as Gale’s evenness criterion, Dol’nikov’s theorem, or Ramos’s theorem. The self-citations to the authors’ earlier work [27] are descriptive and not load-bearing: the paper explicitly says the earlier result is a special case that also follows from Theorem 2.6, and it does not cite [27] to prove any main theorem. There are no fitted parameters presented as predictions, no imported uniqueness theorem, and no ansatz smuggled in via self-citation. One proof (Theorem 2.5) invokes a partition of unity subordinate to a cover by closed sets q(A_i), which is not guaranteed to exist in that generality and may constitute a genuine proof gap; however, this is a correctness/technicality concern, not circularity, since the argument does not presuppose the conclusion or define the conclusion into existence. Overall, the central claims have independent mathematical content and reduce to the external Borsuk–Ulam theorem, so the circularity score is 0.

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

The paper uses standard topological facts (Borsuk-Ulam, degree theory, partitions of unity) and one external theorem for the product case. No free parameters or invented entities appear. The main risk is the reliance on fine symmetric triangulations and on the cited Ramos theorem for the (Z/2)^2 extension.

assumptions (6)
  • standard math Borsuk-Ulam theorem for odd maps S^d to R^d
    Used in the proof of Theorem 1.2, Theorem 2.2, Lemma 2.4, Theorem 2.5; the paper's central reduction relies on it.
  • standard math Existence of arbitrarily fine antipodally symmetric triangulations of S^d with facet diameter less than epsilon
    Used in the proof of Theorem 1.2 and Theorem 2.6; standard but not proved in the paper.
  • standard math Partition of unity subordinate to a finite closed cover on RP^d
    Used in the proof of Theorem 2.5; requires the cover to be such that continuous partitions exist, which is standard for finite closed covers of paracompact spaces.
  • domain assumption Ramos's theorem: no (Z/2)^2-equivariant map S^d x S^{d-1} to S^{2d-2} for d a power of two
    The entire Section 6 depends on Theorem 6.1 which is cited from [57]; the paper does not prove it.
  • standard math Degree theory facts: local degree sum computes degree for maps that are local homeomorphisms at preimage points
    Used in the proof of Theorem 2.2 with a citation to Hatcher.
  • standard math Gale's evenness criterion for cyclic polytopes
    Used to identify Fan's theorem as the cyclic-order special case of Theorem 1.2.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Covering and labeling generalizations of the Borsuk-Ulam theorem." pith.science (2026). https://pith.science/paper/QDPOLWEL

@misc{pith2026250907247,
  author       = {Pith},
  title        = {Pith review of: Covering and labeling generalizations of the Borsuk-Ulam theorem},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/QDPOLWEL}},
  note         = {Machine review of arXiv:2509.07247}
}
read the original abstract

We prove multiple generalizations of Fan's combinatorial labeling result for sphere triangulations. This can be seen as a comprehensive extension of the Borsuk--Ulam theorem. In typical applications, the Borsuk--Ulam theorem gives complexity bounds in a suitable sense, whereas our extension additionally provides insight into the structure of objects satisfying the complexity bound. This structure is governed by order types of finite point sets in Euclidean space and more generally by the intersection combinatorics of faces under continuous maps from the simplex. We develop some of those applications for sphere coverings, Kneser-type colorings, Hall-type results for hypergraphs, and hyperplane mass partitions, among other consequences. We provide a new proof of the topological Hall theorem and extend it into a result that simultaneously generalizes hypergraph Hall theorems and topological lower bounds for chromatic numbers.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Selection-structure generalizations of the Borsuk-Ulam theorem

    math.CO 2026-07 conditional novelty 6.0 of 10

    Selection structures admit Fan–Radon and Volovikov-type Borsuk–Ulam theorems whose conclusions are governed by Radon and Tverberg partitions, yielding new ham-sandwich and necklace-splitting results.

Reference graph

Works this paper leans on

74 extracted references · 73 canonical work pages · cited by 1 Pith paper

  1. [59]

    Walter Rudin,Real and complex analysis, New York: McGraw-Hill, 1987

    work page 1987

  2. [1]

    Henry Adams, Johnathan Bush, Nate Clause, Florian Frick, Mario Gómez, Michael Harrison, R. Amzi Jeffs, Evgeniya Lagoda, Sunhyuk Lim, Facundo Mémoli, Michael Moy, Nikola Sadovek, Matt Superdock, COVERING AND LABELING GENERALIZATIONS OF THE BORSUK–ULAM THEOREM 21 Daniel Vargas, Qingsong Wang, and Ling Zhou,Gromov–Hausdorff distances, Borsuk–Ulam theorems, a...

    arXiv 2023

  3. [2]

    Ron Aharoni, Eli Berger, Joseph Briggs, Erel Segal-Halevi, and Shira Zerbib,Fractionally balanced hyper- graphs and rainbow KKM theorems, Combinatorica42(2022), no. Suppl. 1, 913–951

    work page 2022

  4. [3]

    Graph Theory35(2000), no

    Ron Aharoni and Penny Haxell,Hall’s theorem for hypergraphs, J. Graph Theory35(2000), no. 2, 83–88

    work page 2000

  5. [4]

    James Aisenberg, Maria Luisa Bonet, and Sam Buss,2-D Tucker is PPA complete, J. Comp. Sys. Sciences 108(2020), 92–103

    work page 2020

  6. [5]

    Sigma8(2020), e5

    Jai Aslam, Shujian Chen, Florian Frick, Sam Saloff-Coste, Linus Setiabrata, and Hugh Thomas,Splitting loops and necklaces: variants of the square peg problem, Forum Math. Sigma8(2020), e5

    work page 2020

  7. [6]

    1479–1495

    Per Austrin, Amey Bhangale, and Aditya Potukuchi,Improved inapproximability of rainbow coloring, Pro- ceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, 2020, pp. 1479–1495

    work page 2020

  8. [7]

    Math.18(1966), 492–502

    Philip Bacon,Equivalent formulations of the Borsuk-Ulam theorem, Canadian J. Math.18(1966), 492–502

    work page 1966

Show all 74 references
  1. [8]

    Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, Ramamoorthi Ravi, and Anastasios Sidiropoulos,Approximation algorithms for low-distortion embeddings into low-dimensional spaces, Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithm...

    2005

  2. [9]

    Bajmóczy and Imre Bárány,On a common generalization of Borsuk’s and Radon’s theorem, Acta Math

    Ervin G. Bajmóczy and Imre Bárány,On a common generalization of Borsuk’s and Radon’s theorem, Acta Math. Acad. Sci. Hungar.34(1979), 347–350

    1979

  3. [10]

    Luis Barba, Alexander Pilz, and Patrick Schnider,Sharing a pizza: bisecting masses with two cuts, arXiv preprint arXiv:1904.02502 (2019)

    1904 arXiv

  4. [11]

    Thomas Bartsch,Topological methods for variational problems with symmetries, Springer, 2006

    2006

  5. [12]

    Pavle V. M. Blagojević and Günter M. Ziegler,Beyond the Borsuk–Ulam theorem: the topological Tverberg story, A Journey Through Discrete Mathematics: A Tribute to Jiří Matoušek (2017), 273–341

    2017

  6. [13]

    Math.20(1933), 177–190

    Karol Borsuk,Drei Sätze über dien-dimensionale euklidische Sphäre, Fund. Math.20(1933), 177–190

    1933

  7. [14]

    Tristan Hull,Borsuk–Ulam theorems for products of spheres and Stiefel manifolds revisited, Topol

    Yu Hin Chan, Shujian Chen, Florian Frick, and J. Tristan Hull,Borsuk–Ulam theorems for products of spheres and Stiefel manifolds revisited, Topol. Methods in Nonlinear Anal.55(2019), 553–564

    2019

  8. [15]

    1769–1780

    Zachary Chase, Bogdan Chornomaz, Shay Moran, and Amir Yehudayoff,Local Borsuk–Ulam, stability, and replicability, Proceedings of the 56th Annual ACM Symposium on Theory of Computing (STOC), 2024, pp. 1769–1780

    2024

  9. [16]

    thesis, ETH Zurich, 2005

    Péter Csorba,Non-tidy spaces and graph colorings, Ph.D. thesis, ETH Zurich, 2005

    2005

  10. [17]

    6, 669–682

    Péter Csorba,Homotopy types of box complexes, Combinatorica27(2007), no. 6, 669–682

    2007

  11. [18]

    Péter Csorba, Carsten Lange, Ingo Schurr, and Arnold Wassmer,Box complexes, neighborhood complexes, and the chromatic number, J. Combin. Theory, Ser. A108(2004), no. 1, 159–168

    2004

  12. [19]

    6, 114422

    Hamid Reza Daneshpajouh and Frédéric Meunier,Box complexes: At the crossroad of graph theory and topology, Discrete Math.348(2025), no. 6, 114422

    2025

  13. [20]

    Jesús De Loera, Xavier Goaoc, Frédéric Meunier, and Nabil Mustafa,The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, Bull. Amer. Math. Soc.56(2019), 415–511

    2019

  14. [21]

    Dol’nikov,A certain combinatorial inequality, Siberian Math

    Vladimir L. Dol’nikov,A certain combinatorial inequality, Siberian Math. J.29(1988), no. 3, 375–379

    1988

  15. [22]

    Math.56 (1952), no

    Ky Fan,A generalization of Tucker’s combinatorial lemma with topological applications, Ann. Math.56 (1952), no. 3, 431–437

    1952

  16. [23]

    Ky Fan,A minimax inequality and applications, Inequalities3(1972), 103–113

    1972

  17. [24]

    Math.98(1982), no

    Ky Fan,Evenly distributed subsets ofSn and a combinatorial application, Pacific J. Math.98(1982), no. 2, 323–325

    1982

  18. [25]

    Antonio Flores,Über n-dimensionale Komplexe, die imR2n+1 absolut selbstverschlungen sind, Ergeb. Math. Kolloq.34(1933), 4–6

    1933

  19. [26]

    Freund and Michael J

    Robert M. Freund and Michael J. Todd,A constructive proof of Tucker’s combinatorial lemma, J. Combin. Theory, Ser. A30(1981), no. 3, 321–325

    1981

  20. [27]

    (2025), no

    Florian Frick and Zoe Wellner,Colorful Borsuk–Ulam theorems and applications, Fixed Point Theory Appl. (2025), no. 81, 1–20

    2025

  21. [28]

    Florian Frick and Shira Zerbib,Colorful coverings of polytopes and piercing numbers of colorfuld-intervals, Combinatorica39(2019), 627–637

    2019

  22. [29]

    David Gale,Neighborly and cyclic polytopes, Proc. Sympos. Pure Math., vol. 7, 1963, pp. 225–232. 22 FRICK AND WELLNER

    1963

  23. [30]

    David Gale,Equilibrium in a discrete exchange economy with money, Internat. J. Game Theory13(1984), no. 1, 61–64

    1984

  24. [31]

    Goodman and Richard Pollack,Upper bounds for configurations and polytopes inR d, Discrete Comput

    Jacob E. Goodman and Richard Pollack,Upper bounds for configurations and polytopes inR d, Discrete Comput. Geom.1(1986), 219–227

    1986

  25. [32]

    23-24, 2663–2668

    Hossein Hajiabolhassan,A generalization of Kneser’s conjecture, Discrete Math.311(2011), no. 23-24, 2663–2668

    2011

  26. [33]

    Hamed Hatami, Kaave Hosseini, and Xiang Meng,A Borsuk-Ulam lower bound for sign-rank and its applica- tions, Proceedingsofthe55thAnnualACMSymposiumonTheoryofComputing(STOC),2023, pp.463–471

    2023

  27. [34]

    Allen Hatcher,Algebraic topology, Algebraic Topology, Cambridge University Press, 2002

    2002

  28. [35]

    Alfredo Hubard and Roman Karasev,Bisecting measures with hyperplane arrangements, Math. Proc. Cam- bridge Philos. Soc.169(2020), no. 3, 639–647

    2020

  29. [36]

    Marek Izydorek and Jan Jaworowski,Antipodal coincidence for maps of spheres into complexes, Proc. Amer. Math. Soc.123(1995), no. 6, 1947–1950

    1995

  30. [37]

    Math.17(2000), no

    Jan Jaworowski,Periodic coincidence for maps of spheres, Kobe J. Math.17(2000), no. 1, 21–26

    2000

  31. [38]

    Math.14(1929), no

    Bronislaw Knaster, Kazimierz Kuratowski, and Stefan Mazurkiewicz,Equilibrium in a discrete exchange economy with money, Fund. Math.14(1929), no. 1, 132–137

    1929

  32. [39]

    Theory4(1994), 463–466

    Hidetoshi Komiya,A simple proof of K-K-M-S theorem, Econom. Theory4(1994), 463–466

    1994

  33. [40]

    21, Springer Science & Business Media, 2008

    Dimitry Kozlov,Combinatorial algebraic topology, vol. 21, Springer Science & Business Media, 2008

    2008

  34. [41]

    Topol.27(2023), 3733–3800

    Sunhyuk Lim, Facundo Mémoli, and Zane Smith,The Gromov–Hausdorff distance between spheres, Geom. Topol.27(2023), 3733–3800

    2023

  35. [42]

    Lásló Lovász,Kneser’s conjecture, chromatic number and homotopy, J. Combin. Theory Ser. A25(1978), 319–324

    1978

  36. [43]

    Lazar Lusternik and Lev Schnirelman,Topological methods in variational calculus, Issledowatelskii Institut Matematiki i Mechaniki pri OMGU, Moscow (1930)

    1930

  37. [44]

    Math.207(2006), no

    Peter Mani-Levitska, Siniša Vrećica, and Rade Živaljević,Topology and combinatorics of partitions of masses by hyperplanes, Adv. Math.207(2006), no. 1, 266–296

    2006

  38. [45]

    Ziegler,Topological lower bounds for the chromatic number: A hierarchy, Jahresber

    Jiří Matoušek and Günter M. Ziegler,Topological lower bounds for the chromatic number: A hierarchy, Jahresber. Dtsch. Math.-Ver.106(2004), 71–90

    2004

  39. [46]

    Jiří Matoušek,Using the Borsuk–Ulam theorem, Springer–Verlag Berlin Heidelberg, 2003

    2003

  40. [47]

    Takahiro Matsushita,Some examples of non-tidy spaces, arXiv preprint arXiv:1404.5848 (2014)

    2014 arXiv

  41. [48]

    Daniel McGinnis,Matroid colorings of KKM covers, arXiv preprint arXiv:2409.03026 (2024)

    2024 arXiv

  42. [49]

    Geom.71 (2024), no

    Daniel McGinnis and Shira Zerbib,A sparse colorful polytopal KKM theorem, Discrete Comput. Geom.71 (2024), no. 3, 945–959

    2024

  43. [50]

    Roy Meshulam,Domination numbers and homology, J. Combin. Theory, Ser. A102(2003), no. 2, 321–330

    2003

  44. [51]

    Frédéric Meunier and Luis Montejano,Different versions of the nerve theorem and colourful simplices, J. Combin. Theory, Ser. A169(2020), 105125

    2020

  45. [52]

    Frédéric Meunier and Francis Edward Su,Multilabeled versions of Sperner’s and Fan’s lemmas and applica- tions, SIAM J. Appl. Algebra Geom.3(2019), 391–411

    2019

  46. [53]

    Musin,Generalizations of Tucker–Fan–Shashkin lemmas, Arnold Math

    Oleg R. Musin,Generalizations of Tucker–Fan–Shashkin lemmas, Arnold Math. J.2(2016), no. 3, 299–308

    2016

  47. [54]

    Timothy Prescott and Francis Edward Su,A constructive proof of Ky Fan’s generalization of Tucker’s lemma, J. Combin. Theory, Ser. A111(2005), no. 2, 257–265

    2005

  48. [55]

    Rabinowitz,Multiple critical points of perturbed symmetric functionals, Trans

    Paul H. Rabinowitz,Multiple critical points of perturbed symmetric functionals, Trans. Amer. Math. Soc. 272(1982), no. 2, 753–769

    1982

  49. [56]

    Ann.83(1921), no

    Johann Radon,Mengen konvexer Körper, die einen gemeinsamen Punkt enthalten, Math. Ann.83(1921), no. 1, 113–115

    1921

  50. [57]

    Ramos,Equipartition of mass distributions by hyperplanes, Discrete Comput

    Edgar A. Ramos,Equipartition of mass distributions by hyperplanes, Discrete Comput. Geom.15(1996), 147–167

    1996

  51. [58]

    Edgardo Roldán-Pensado and Pablo Soberón,A survey of mass partitions, Bull. Amer. Math. Soc.59(2022), no. 2, 227–267

    2022

  52. [60]

    Shapley,On balanced games without side payments, RAND Corporation, Santa Monica, CA, 1972

    Lloyd S. Shapley,On balanced games without side payments, RAND Corporation, Santa Monica, CA, 1972

    1972

  53. [61]

    Shchepin,On a problem of L

    Evgeni˘ ı V. Shchepin,On a problem of L. A. Tumarkin, Sov. Math., Dokl.15(1974), 1024–1026 (English). COVERING AND LABELING GENERALIZATIONS OF THE BORSUK–ULAM THEOREM 23

    1974

  54. [62]

    Mau-Hsiang Shih and Shyh-Nan Lee,Combinatorial formulae for multiple set-valued labellings, Math. Ann. 296(1993), no. 1, 35–61

    1993

  55. [63]

    Simmons and Francis Edward Su,Consensus-halving via theorems of Borsuk-Ulam and Tucker, Math

    Forest W. Simmons and Francis Edward Su,Consensus-halving via theorems of Borsuk-Ulam and Tucker, Math. Social Sciences45(2003), no. 1, 15–25

    2003

  56. [64]

    Gábor Simonyi and Gábor Tardos,Local chromatic number, Ky Fan’s theorem, and circular colorings, Com- binatorica26(2006), 587–626

    2006

  57. [65]

    Gábor Simonyi and Gábor Tardos,Colorful subgraphs in Kneser-like graphs, Europ. J. Combin.28(2007), no. 8, 2188–2200

    2007

  58. [66]

    Gábor Simonyi, Gábor Tardos, and Siniša Vrećica,Local chromatic number and distinguishing the strength of topological obstructions, Trans. Amer. Math. Soc.361(2009), no. 2, 889–908

    2009

  59. [67]

    Pablo Soberón,Fair distributions for more participants than allocations, Proc. Amer. Math. Soc., Ser. B9 (2022), no. 38, 404–414

    2022

  60. [68]

    Heinrich Steinlein,Borsuk’s antipodal theorem and its generalizations and applications: A survey, méthodes topologiques en analyse non linéaire, Sem. Math. Sup.95(1985), 166–235

    1985

  61. [69]

    Francis Edward Su,Borsuk-Ulam implies Brouwer: a direct construction, Amer. Math. Monthly104(1997), no. 9, 855–859

    1997

  62. [70]

    Francis Edward Su,Rental harmony: Sperner’s lemma in fair division, Amer. Math. Monthly106(1999), no. 10, 930–942

    1999

  63. [71]

    Tucker,Some topological properties of disk and sphere, Proc

    Albert W. Tucker,Some topological properties of disk and sphere, Proc. First Canadian Math. Congress, 1945, pp. 285–309

    1945

  64. [72]

    van Kampen,Komplexe in euklidischen Räumen, Abh

    Egbert R. van Kampen,Komplexe in euklidischen Räumen, Abh. Math. Semin. Univ. Hambg.9(1933), 72–78

    1933

  65. [73]

    Volovikov,Borsuk-Ulam implies Brouwer: a direct construction revisited, Amer

    Alexey Yu. Volovikov,Borsuk-Ulam implies Brouwer: a direct construction revisited, Amer. Math. Monthly 115(2008), no. 6, 553–556

    2008

  66. [74]

    Živaljević,WI-posets, graph complexes andZ2-equivalences, J

    Rade T. Živaljević,WI-posets, graph complexes andZ2-equivalences, J. Combin. Theory Ser. A111(2005), no. 2, 204–223. (FF)Dept. Math. Sciences, Carnegie Mellon University, Pittsburgh, PA 15213, USA Email address:frick@cmu.edu (ZW)School of Math. and Stat. Sciences, Arizona Stat...

    2005

Pith tools

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