Pith. sign in

REVIEW 4 minor 1 cited by

A Colorful Extension of VC-dimension and Geometric Applications

T0 review · 0 major / 4 minor · reviewed 2026-07-14 · grok-4.5

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

Pith's one-line read A colorful VC-dimension bound yields Tverberg numbers O(D^{2} r log r) in separable abstract convexity spaces, plus improved selection, weak nets, and (p,q) theorems.

desk verdict Clean combinatorial upgrade of Alon–Smorodinsky that delivers the first quasi-linear Tverberg bound with only polynomial D-dependence for separable convexity spaces. read the letter →

arxiv 2607.10496 v1 pith:CSLONO5U submitted 2026-07-11 math.CO cs.CG

Chaya Keller , Shakhar Smorodinsky This is my paper
classification math.COcs.CG MSC 52A3552C1005D4068Q32
keywords VC-dimensioncolorfulshatteringabstractconvexityTverbergnumberRadonselectionlemmaweakε-nets(pq)-theorem
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

Abstract convexity spaces with finite Radon number D are combinatorial models of convex geometry. Separable ones admit a halfspace system whose ordinary VC-dimension is only D-1. The paper shows that this ordinary bound already controls a new colorful k-wise shattering number, which is at most O(k D log(k D r)). Feeding that combinatorial statement into the halfspace system produces a rainbow partition theorem: sufficiently many color classes of size r force a rainbow partition into r parts whose convex hulls meet k-wise. Setting k equal to the Helly number D-1 then yields an ordinary Tverberg theorem with only O(D^{2} r log r) points. The same rainbow theorem also supplies a colorful selection lemma with O(D^{3}) colors; from there the classical greedy and LP-duality arguments give weak ε-nets of size O_D(ε^{-O(D^{3})}) and a quantitative (p,q)-theorem whose exponent is polynomial in D. All of these quantitative bounds improve the previous general estimates for abstract convexity spaces, and the same shattering method extends to a colorful Tverberg theorem for unions of convex sets.

What carries the argument

Colorful (k,r)-shattering: a colored set with r-point color classes is colorfully (k,r)-shattered if every rainbow partition into r parts admits k hyperedges that contain those parts and have empty total intersection. The paper bounds the largest number of color classes that can be so shattered by O(k v log(k v r)).

What would settle it

Exhibit a separable abstract convexity space of Radon number D whose Tverberg number Tv_C(r) grows faster than C D^{2} r log r for infinitely many r > D, or show that the colorful (k,r)-VC-dimension of some VC-dimension-v set system exceeds every constant times k v log(k v r).

Watch

Extended reading notes

Core claim

In any set system of VC-dimension v the colorful (k,r)-VC-dimension is O(k v log(k v r)). Applied to the halfspace hypergraph of a separable convexity space of Radon number D, this combinatorial bound produces a colorful k-wise Tverberg theorem with O(k D log(k D r)) colors of size r each; the ordinary Tverberg number is therefore O(D^{2} r log r) for r > D.

Load-bearing premise

Any two disjoint convex sets can be separated by a single halfspace; without that separation the halfspace certificates fail and the argument only recovers weaker bounds that replace halfspaces by intersections of O(D) halfspaces.

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

0 major / 4 minor

Summary. The paper introduces a colorful (k,r)-shattering notion and the associated colorful VC-dimension VCcol_{k,r}(H). It proves that VCdim(H)≤v implies VCcol_{k,r}(H)≤O(kv log(kvr)) (Theorem 1.4) via Perles–Sauer–Shelah counting of traces, Bregman–Minc permanent bounds on rainbow assignments, and a standard logarithmic inversion. Applied to the halfspace hypergraph of a separable abstract convexity space (VCdim=D-1 by Lemma 3.1), this yields a colorful k-wise Tverberg theorem (Theorem 1.5) and, via Levi’s Helly bound with k=D-1, the improved uncolored Tverberg number Tv_C(r)≤O(D^{2} r log r) for r>D (Theorem 1.8). The same framework produces a colorful selection lemma with O(D^{3}) colors, an uncolored selection lemma for a=O(D^{3})-sets, polynomial weak ε-nets of size O_D(ε^{-O(D^{3})}), a quantitative (p,q)-theorem with poly(D) exponent, and a colorful Tverberg theorem for s-convex sets. Section 8 records the weaker bounds that survive under only point–convex separation.

Significance. The main Tverberg bound is the first quasi-linear-in-r result for separable convexity spaces whose dependence on the Radon number D is only polynomial (improving the O(D r^{2} log r) of Alon–Smorodinsky and avoiding the tower-type dependence of Pálvölgyi). The colorful VC bound itself is a clean combinatorial statement of independent interest, proved by elementary counting with no free parameters. The subsequent selection, weak-net and (p,q) consequences give the best general quantitative bounds currently available for separable abstract convexity spaces. The paper carefully isolates the role of the two-convex-set separation axiom and supplies the corresponding weaker statements under point–convex separation, which strengthens the contribution.

minor comments (4)
  1. In the proof of Theorem 1.4 the constant C hidden in the Sauer–Shelah bound “C(ℓr)^v” is never made explicit; a one-line reference to the usual binomial sum would make the O-notation fully transparent.
  2. The transition from the colorful restricted Tverberg theorem (Corollary 3.3) to the colorful selection lemma (Theorem 4.1) uses a multiset of labelled convex hulls; a short clarifying sentence that multiplicities are essential for the fractional-Helly counting would help the reader.
  3. Section 8 introduces the compactness assumption for finitely generated convex sets without a reference; a pointer to a standard source (or a one-sentence justification) would be useful.
  4. A few typographical inconsistencies appear (e.g., “SODA’26” vs. “SODA’26”, occasional missing spaces around O-notation). They do not affect readability but should be cleaned in the final version.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the colorful VC bound is an independent combinatorial counting argument, and the geometric consequences follow from it by standard external lemmas under the paper's stated separation axioms.

full rationale

The derivation chain is self-contained and non-circular. Theorem 1.4 bounds colorful (k,r)-VC-dimension by a pure counting argument: number of rainbow partitions (r!)^ℓ versus at most r^k (C(ℓr)^v)^k certificates, Bregman–Minc permanent bound giving ρ_r ≥ 2, and the elementary inversion m ≤ A log(Bm). This uses only the classical Perles–Sauer–Shelah lemma and does not depend on any geometric conclusion. Lemma 3.1 shows that the halfspace hypergraph of a separable space has VC-dimension D-1 by the definition of Radon number plus the first separation axiom; the same axiom licenses the iterative replacement of empty-intersecting convex hulls by halfspaces in the proof of Theorem 1.5. The ordinary Tverberg bound (Theorem 1.8) then follows by setting k = D-1 and invoking Levi’s classical Helly theorem (external, 1951). Selection lemmas, weak ε-nets and the (p,q)-theorem are obtained from the colorful Tverberg statement by the fractional Helly theorem of Holmsen–Patáková and the classical Alon–Bárány–Füredi–Kleitman / Alon–Kleitman schemes; none of these steps redefine their inputs as outputs. The paper cites its own prior SODA’26 work only as the result being improved, not as a load-bearing uniqueness or ansatz. Section 8 explicitly isolates the weaker point-convex separation case and recovers only the slightly worse bounds that follow from replacing halfspaces by O(D)-fold intersections, confirming that the main claims are not forced by hidden self-reference. There are no fitted parameters, no self-definitional loops, and no uniqueness theorems imported from the authors. Score 0 is therefore the correct assessment.

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

The paper rests on a short list of classical combinatorial lemmas and two recent geometric theorems; no free parameters or ad-hoc physical entities are introduced. The only invented objects are the colorful shattering notions, which are purely definitional.

assumptions (5)
  • standard math Perles–Sauer–Shelah lemma: VC-dimension ≤ v implies at most O(m^v) traces on an m-set
    Invoked in the proof of Theorem 1.4 to bound the number of possible k-tuples of traces.
  • standard math Bregman–Minc inequality for permanents of 0-1 matrices with bounded row sums
    Used to upper-bound the number of rainbow partitions certified by a fixed k-tuple of traces.
  • domain assumption Levi’s theorem: Helly number of a convexity space is at most Radon number minus one
    Converts (D-1)-wise intersection of convex hulls into full r-fold intersection (Corollaries 3.2, 3.3, Theorems 1.7–1.8).
  • domain assumption Fractional Helly theorem of Holmsen–Patáková for separable convexity spaces (fractional Helly number ≤ dual VC-dimension + 1 ≤ 2D)
    Supplies the function β_d used in the selection lemma, weak ε-nets and (p,q)-theorem.
  • standard math Assouad’s inequality relating dual and primal VC-dimension
    Gives dual VC-dimension < 2D, hence fractional Helly number ≤ 2D+1.
invented entities (1)
  • colorful (k,r)-shattering / colorful VC-dimension VCcol_{k,r}
    purpose: Captures rainbow certificates of empty k-fold intersections; the combinatorial engine that yields all subsequent geometric bounds
    Defined in Definition 1.3; no independent experimental handle, but the definition is purely combinatorial and immediately yields falsifiable quantitative predictions (the Tverberg numbers).

how reviews work

0 comments
Cite this review

Pith. "Pith review of A Colorful Extension of VC-dimension and Geometric Applications." pith.science (2026). https://pith.science/paper/CSLONO5U

@misc{pith2026260710496,
  author       = {Pith},
  title        = {Pith review of: A Colorful Extension of VC-dimension and Geometric Applications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/CSLONO5U}},
  note         = {Machine review of arXiv:2607.10496}
}
abstract

The VC-dimension is a fundamental measure of the complexity of a set system. In this paper, we introduce and study a colorful variant of VC-dimension that captures the behavior of set systems on colored ground sets. By studying this new notion, we obtain a variety of geometric results. First, we prove that separable abstract convexity spaces with Radon number $D$ admit a Tverberg theorem with Tverberg number $O(D^2 r \log r)$. This bound significantly improves the $O(Dr^2\log r)$ bound of Alon and Smorodinsky from SODA'26 and is the first quasi-linear bound in $r$, in which the dependence on $D$ is not super-exponential. Second, we prove the first colorful $k$-wise Tverberg theorem for separable abstract convexity spaces. Using this theorem, we obtain a colorful selection lemma with $O(D^3)$ colors, an uncolored selection lemma for subsets of size $O(D^3)$, a weak $\varepsilon$-net theorem with nets of size $O_D(\varepsilon^{-O(D^3)})$, and a $(p,q)$-theorem with exponent of $\mathrm{poly}(D)$. All these quantitative bounds are significantly better than the best previously known general bounds for abstract convexity spaces. Finally, we extend our method to obtain a colorful Tverberg theorem for unions of convex sets, generalizing the uncolored theorem of Alon and Smorodinsky (SODA'26).

Discussion (0). Sign in 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. Strong invariants and Tverberg numbers in convexity spaces

    math.CO 2026-07 accept novelty 7.0 of 10

    In convexity spaces, VC-dimension, strong Helly, strong Carathéodory, comatching, and strong Radon numbers coincide; for S3-separable spaces the Tverberg number satisfies r_t = O(r^2 log r) t.

Reference graph

Works this paper leans on

300 extracted references · 8 canonical work pages · cited by 1 Pith paper

  1. [1]

    Aronov and E

    B. Aronov and E. Ezra and M. Sharir , title =

  2. [2]

    Pyrga and S

    E. Pyrga and S. Ray , title =. Proceedings of

  3. [3]

    H. Br. Almost Optimal Set Covers in Finite. 1995 , pages =

    1995

  4. [4]

    and Tardos, G

    Pach, J. and Tardos, G. , TITLE =. J. Amer. Math. Soc. , VOLUME =. 2013 , NUMBER =

    2013

  5. [5]

    Haussler and E

    D. Haussler and E. Welzl , title =

  6. [6]

    Balogh and J

    J. Balogh and J. Solymosi , title =. Discrete Analysis , volume =

  7. [7]

    Alon , title =

    N. Alon , title =. Disc. Comput. Geom. , volume =

  8. [8]

    A generalization of

    B. A generalization of. Discrete Mathematics , volume =

Show all 300 references
  1. [9]

    Journal of Combinatorial Theory, Series A , volume =

    Sauer, Norbert , title =. Journal of Combinatorial Theory, Series A , volume =

  2. [10]

    Geometric and Functional Analysis , volume =

    Gromov, Mikhail , title =. Geometric and Functional Analysis , volume =

  3. [11]

    Bus and S

    N. Bus and S. Garg and N. H. Mustafa and S. Ray , title =. Comput. Geom. , volume =

  4. [12]

    Kalai, Gil , title =

  5. [13]

    J. Matou. How to Net a Lot with Little:. Proceedings of. 1990 , pages =

    1990

  6. [14]

    N. H. Mustafa and K. Dutta and A. Ghosh , title =. Combinatorica , volume =

  7. [15]

    Kupavskii and N

    A. Kupavskii and N. H. Mustafa and J. Pach , title =. Proceedings of

  8. [16]

    T. M. Chan and E. Grant and J. K. Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling , booktitle =

  9. [17]

    K. L. Clarkson and K. R. Varadarajan , title =. Discret. Comput. Geom. , volume =

  10. [18]

    Kupavskii and N

    A. Kupavskii and N. Zhivotovskiy , title =. J. Comput. Syst. Sci. , volume =

  11. [19]

    K. R. Varadarajan , title =. Proceedings of

  12. [20]

    T. M. Chan and C. Keller and S. Smorodinsky , title =. Proceedings of

  13. [21]

    T. M. Chan and C. Keller and S. Smorodinsky , title =

  14. [22]

    Keller and S

    C. Keller and S. Smorodinsky , title =. Proceedings of

  15. [23]

    Chalermsook and L

    P. Chalermsook and L. Orgo and M. Zarsav , title =. Graph

  16. [24]

    Hunter and A

    Z. Hunter and A. Milojevi

  17. [25]

    Ackerman and B.Keszegh

    E. Ackerman and B.Keszegh. , title =

  18. [26]

    Basit and A

    A. Basit and A. Chernikov and S. Starchenko and T. Tao and C. M. Tran. , title =. Forum Math. Sigma , volume =

  19. [27]

    T. M. Chan and S. Har. On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings , journal =

  20. [28]

    Fox and J

    J. Fox and J. Pach and A. Sheffer and A. Suk and J. Zahl , title =. J. Euro. Math. Soc. , volume =

  21. [29]

    Janzer and C

    O. Janzer and C. Pohoata , title =. Combinatorica , volume =

  22. [30]

    P. K. On a problem of. Colloq. Math. , volume =

  23. [31]

    Tidor and H

    J. Tidor and H. H. H. Yu , title =

  24. [32]

    P. E. Eleftheriou and A. Papadopoulos , title =

  25. [33]

    Rubin , title =

    N. Rubin , title =. Proceedings of

  26. [34]

    Alon and B

    N. Alon and B. Awerbuch and Y. Azar and N. Buchbinder and J. Naor , title =. Proceedings of

  27. [35]

    Khan and A

    A. Khan and A. Lonkar and S. Rahul and A. Subramanian and A. Wiese , title =. Proceedings of

  28. [36]

    Bhore and D

    S. Bhore and D. Dey and S. Singh , title =. Proceedings of

  29. [37]

    De and S

    M. De and S. Jain and S. V. Kallepalli and S. Singh , title =. Algorithmica , volume =

  30. [38]

    Even and S

    G. Even and S. Smorodinsky , title =. Discret. Appl. Math. , volume =

  31. [39]

    De and S

    M. De and S. Singh and C. D. T. Online Hitting Sets for Disks of Bounded Radii , booktitle =

  32. [40]

    De and R

    M. De and R. Mandal and S. Singh , title =. Proceedings of

  33. [41]

    Charikar and C

    M. Charikar and C. Chekuri and T. Feder and R. Motwani , title =

  34. [42]

    Dumitrescu and C

    A. Dumitrescu and C. D. T. Online Unit Clustering and Unit Covering in Higher Dimensions , journal =

  35. [43]

    T. M. Chan and Q. He and S. Suri and J. Xue , title =

  36. [44]

    Ackerman and B

    E. Ackerman and B. Keszegh and D. P. On tangencies among planar curves with an application to coloring. Eur. J. Comb. , volume =

  37. [45]

    Kaplan , title =

    I. Kaplan , title =. Adv. Math. , volume =

  38. [46]

    Edwards and P

    T. Edwards and P. Sober. Extensions of Discrete

  39. [47]

    Jung and D

    A. Jung and D. P. k-Dimensional Transversals for Fat Convex Sets , booktitle =

  40. [48]

    Gangopadhyay and A

    R. Gangopadhyay and A. Polyanskii and W. Rao , title =

  41. [49]

    Keller and M

    C. Keller and M. A. Perles , title =

  42. [50]

    Chakraborty and A

    S. Chakraborty and A. Ghosh and S. Nandi , title =. Discret. Math. , volume =

  43. [51]

    Lawrence and W

    J. Lawrence and W. D. Morris Jr. , title =. Discret. Comput. Geom. , volume =

  44. [52]

    Kleitman , title =

    Noga Alon and Daniel J. Kleitman , title =. Adv. Math. , volume =. 1992 , doi =

    1992

  45. [53]

    Matousek , title =

    J. Matousek , title =. Discret. Comput. Geom. , volume =

  46. [54]

    Kleitman and A

    D.J. Kleitman and A. Gy. Convex Sets in the Plane with Three of Every Four Meeting , journal =

  47. [55]

    Improved bounds on the

    Chaya Keller and Shakhar Smorodinsky and G. Improved bounds on the. Israel J. Math. , volume =. 2018 , doi =

    2018

  48. [56]

    Israel J

    Chaya Keller and Shakhar Smorodinsky , title =. Israel J. Math. , volume =. 2021 , doi =

    2021

  49. [57]

    Keller and S

    C. Keller and S. Smorodinsky , title =. Discret. Comput. Geom. , volume =

  50. [58]

    Rolnick and P

    D. Rolnick and P. Sober. Quantitative (p, q) theorems in combinatorial geometry , journal =

  51. [59]

    Frankl and A

    N. Frankl and A. Jung and I. Tomon , title =

  52. [60]

    Garber and C

    D. Garber and C. Keller and O. Nissenbaum and S. Aviram , title =

  53. [61]

    Keller and M

    C. Keller and M. A. Perles , title =. Graphs Comb. , volume =

  54. [62]

    Discrete Comput

    D. Discrete Comput. Geom. , volume =. 2022 , doi =

    2022

  55. [63]

    and Debrunner, H

    Hadwiger, H. and Debrunner, H. , pages=. 1957 , journal=

    1957

  56. [64]

    Dol'nikov, V. L. , TITLE =. Sibirsk. Mat. Z. , FJOURNAL =. 1972 , PAGES =

    1972

  57. [65]

    On point covers of parallel rectangles , JOURNAL =

    K. On point covers of parallel rectangles , JOURNAL =. 1991 , NUMBER =

    1991

  58. [66]

    and Jiang, M

    Dumitrescu, A. and Jiang, M. Piercing Translates and Homothets of a Convex Body. Algorithmica. 2011

    2011

  59. [67]

    S. J. Kim and K. Nakprasit and M. J. Pelsmajer and J. Skokan. Transversal numbers of translates of a convex body. Discrete Mathematics. 2006

    2006

  60. [68]

    T. M. Chan and S. Har. Approximation Algorithms for Maximum Independent Set of Pseudo-Disks , journal = DCG, volume =

  61. [69]

    Keller and M

    C. Keller and M. A. Perles , title =. Discret. Comput. Geom. , volume =

  62. [70]

    Keller and Y

    C. Keller and Y. Stein , title =. Electron. J. Comb. , volume =

  63. [71]

    Keller and M

    C. Keller and M. A. Perles , title =. Israel J. Math. , volume =

  64. [72]

    Huang and Y

    X. Huang and Y. Qi and M. Rong and Z. Xu , title =

  65. [73]

    Keller and S

    C. Keller and S. Smorodinsky , title =

  66. [74]

    Holmsen and Donggyu Lee , title =

    Andreas F. Holmsen and Donggyu Lee , title =. Israel J. Math. , volume =. 2021 , doi =

    2021

  67. [75]

    A. Gainer. The Minimal Hitting Set Generation Problem: Algorithms and Computation , journal =

  68. [76]

    E. Moreno. The Implicit Hitting Set Approach to Solve Combinatorial Optimization Problems with an Application to Multigenome Alignment , journal =

  69. [77]

    Tverberg , title =

    H. Tverberg , title =. J. London Math. Soc. , volume =

  70. [78]

    Katchalski and A Liu , title =

    M. Katchalski and A Liu , title =. Proc. Amer. Math. Soc. , volume =

  71. [79]

    , pages=

    Pinchasi, R. , pages=. A note on smaller fractional. 2015 , journal=

    2015

  72. [80]

    Chernikov and P

    A. Chernikov and P. Simon , pages=. Definably amenable. 2018 , journal=

    2018

  73. [81]

    2024 , journal=

    Density of compressible types and some consequences , author=. 2024 , journal=

    2024

  74. [82]

    Levi , title =

    Friedrich W. Levi , title =. J. Indian Math. Soc. , volume =

  75. [83]

    J. Koll. Norm-graphs and bipartite. 1996 , journal=

    1996

  76. [84]

    Conlon , pages=

    D. Conlon , pages=. Some remarks on the. 2021 , journal=

    2021

  77. [85]

    2024 , journal=

    Extremal graphs without exponentially small bicliques , author=. 2024 , journal=

    2024

  78. [86]

    P. Erd. On extremal problems of graphs and generalized graphs , journal =

  79. [87]

    Charikar and C

    M. Charikar and C. Pabbaraju , title =. Proceedings of

  80. [88]

    Hanneke and S

    S. Hanneke and S. Moran and T. Waknine , title =. Proceedings of

  81. [89]

    Eckhoff , title =

    J. Eckhoff , title =. Discrete and computational geometry, Algorithms Combin., 25 , pages =

  82. [90]

    Proceedings of the 2026 Annual

    Noga Alon and Shakhar Smorodinsky , title =. Proceedings of the 2026 Annual. 2026 , doi =

    2026

  83. [91]

    Imre B. Bull. Amer. Math. Soc. , volume =. 2022 , doi =

    2022

  84. [92]

    B. K. Natarajan , Journal =. On learning sets and functions , Year =

  85. [93]

    Daniely and S

    A. Daniely and S. Shalev. Optimal learners for multiclass problems , booktitle =

  86. [94]

    1978 , author =

    Existence of submatrices with all possible columns , journal =. 1978 , author =

    1978

  87. [95]

    Brukhim and D

    N. Brukhim and D. Carmon and I. Dinur and S. Moran and A. Yehudayoff , title =. Proceedings of

  88. [96]

    Daniely and M

    A. Daniely and M. Schapira and G. Shahaf , title =. Proceedings of

  89. [97]

    J. R. Calder , title =. J. London Math. Soc. , volume =

  90. [98]

    The partition conjecture , journal =

    J. The partition conjecture , journal =. 2000 , doi =

    2000

  91. [99]

    Holmsen , title =

    Andreas F. Holmsen , title =. 2024 , eprint =

    2024

  92. [100]

    2025 , eprint =

    Wenchong Chen and Gennian Ge and Yang Shu and Zhouningxin Wang and Zixiang Xu , title =. 2025 , eprint =

    2025

  93. [101]

    Imre B. Bull. Amer. Math. Soc. , volume =. 2018 , doi =

    2018

  94. [102]

    2010 , eprint =

    Boris Bukh , title =. 2010 , eprint =

    2010

  95. [103]

    Holmsen and Zuzana Pat

    Andreas F. Holmsen and Zuzana Pat. The fractional. 2024 , eprint =

    2024

  96. [104]

    Discrete Comput

    Shay Moran and Amir Yehudayoff , title =. Discrete Comput. Geom. , volume =. 2020 , doi =

    2020

  97. [105]

    B. Gr. On components of some families of sets , journal =

  98. [106]

    Amenta , title =

    N. Amenta , title =. Disc. Comput. Geom. , volume =

  99. [107]

    Alon and G

    N. Alon and G. Kalai , title =. Disc. Comput. Geom. , volume =

  100. [108]

    J. Matou. A. Disc. Comput. Geom. , volume =

  101. [109]

    Eckhoff and K

    J. Eckhoff and K. P. Nischke , title =. Bull. London Math. Soc. , volume =

  102. [110]

    Furstenberg and Y

    H. Furstenberg and Y. Katznelson , title =. J. Anal. Math. , volume =

  103. [111]

    N. Garc. A Note on the Tolerant. Discret. Comput. Geom. , volume =

  104. [112]

    Sarkar and P

    S. Sarkar and P. Sober. Tolerance for colorful. Eur. J. Comb. , volume =

  105. [113]

    P. Sober. Robust. Comb. Probab. Comput. , volume =

  106. [114]

    D. G. Larman , title =. Comb. Probab. Comput. , volume =

  107. [115]

    Onn , title =

    S. Onn , title =. SIAM J. Discrete Math. , volume =

  108. [116]

    J. P. Doignon , title =. J. Geom , volume =

  109. [117]

    Transversal numbers for hypergraphs arising in geometry , journal =

    Noga Alon and Gil Kalai and Ji. Transversal numbers for hypergraphs arising in geometry , journal =. 2002 , doi =

    2002

  110. [118]

    Kalai and R

    G. Kalai and R. Meshulam , title =. Adv. Math. , volume =

  111. [119]

    I. B. A fractional. Adv. Math. , volume =

  112. [120]

    J. A. De Loera and R. N. La Haye and D. Rolnick and P. Sober. Quantitative. Discret. Comput. Geom. , volume =

  113. [121]

    Jamison , title =

    R. Jamison , title =. Pacific J. Math. , volume =

  114. [122]

    Tight bounds on discrete quantitative. Adv. Appl. Math. , volume =. 2017 , author =

    2017

  115. [123]

    Chen and G

    W. Chen and G. Ge and Y. Shu and Z. Wang and Z. Xu , title =

  116. [124]

    Shelah , title =

    S. Shelah , title =. Israel J. Math. , volume =

  117. [125]

    Chernikov and D

    A. Chernikov and D. Palacin and K. Takeuchi , title =. Notre Dame J. Formal Logic , volume =

  118. [126]

    Point selections and weak -nets for convex hulls , journal =

    Noga Alon and Imre B. Point selections and weak -nets for convex hulls , journal =. 1992 , doi =

    1992

  119. [127]

    Alon and B

    N. Alon and B. Jartoux and C. Keller and S. Smorodinsky and Y. Yuditsky , title =. Discret. Comput. Geom. , volume =

  120. [128]

    J. Koml. Almost Tight Bounds for epsilon-Nets , journal =

  121. [129]

    Bohman and P

    T. Bohman and P. Keevash , title =. Invent. Math. , volume =

  122. [130]

    Fox and J

    J. Fox and J. Pach , title =. Eur. J. Comb. , volume =

  123. [131]

    Conlon and J

    D. Conlon and J. Fox and B. Sudakov , title =. Israel J. Math. , volume =

  124. [132]

    Conlon and J

    D. Conlon and J. Fox and B. Sudakov , title =. J. Amer. Math. Soc. , volume =

  125. [133]

    P. Erd. Discrepancy of trees , journal =

  126. [134]

    Grelier and S

    N. Grelier and S. Gh. Ilchi and T. Miltzow and S. Smorodinsky , title =. Discret. Math. Theor. Comput. Sci. , volume =

  127. [135]

    On discrepancy bounds via dual shatter functions , journal =

    Jir. On discrepancy bounds via dual shatter functions , journal =

  128. [136]

    Discrepancy and approximations for bounded VC-dimension , journal =

    Jir. Discrepancy and approximations for bounded VC-dimension , journal =

  129. [137]

    Norm-Graphs: Variations and Applications , journal =

    Noga Alon and Lajos R. Norm-Graphs: Variations and Applications , journal =

  130. [138]

    Andr. A. Period. Math. Hungarica , volume =

  131. [139]

    A discrepancy version of the

    J. A discrepancy version of the. Comb. Probab. Comput. , volume =

  132. [140]

    Lior Gishboliner and Michael Krivelevich and Peleg Michaeli , title =. J. Comb. Theory, Ser

  133. [141]

    Random Struct

    Lior Gishboliner and Michael Krivelevich and Peleg Michaeli , title =. Random Struct. Algorithms , volume =

  134. [142]

    On the Discrepancies of Graphs , journal =

    J. On the Discrepancies of Graphs , journal =

  135. [143]

    P. K. On a problem of. Colloq. Math. , Pages =

  136. [144]

    Fox and J

    J. Fox and J. Pach and A. Sheffer and A. Suk and J. Zahl , Journal =. A semi-algebraic version of

  137. [145]

    McGuinness

    S. McGuinness. On bounding the chromatic number of L -graphs. Discrete Mathematics. 1996

    1996

  138. [146]

    Krawczyk and B

    T. Krawczyk and B. Walczak , title =. Combinatorica , volume =

  139. [147]

    A. B. Improved bounds for the conflict-free chromatic art gallery problem , booktitle =

  140. [148]

    T. M. Chan and S. Har. On the Number of Incidences When Avoiding an Induced Biclique in Geometric Settings , booktitle =. 2023 , url =. doi:10.1137/1.9781611977554.ch50 , timestamp =

    2023 doi

  141. [149]

    P. K. Agarwal and J. Pach and M. Sharir , title =. Proc. Joint Summer Research Conf. on Discrete and Computational Geometry: 20 Years Later, Contemp. Math. 452 , pages =

  142. [150]

    2014 , url =

    30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014 , publisher =. 2014 , url =. doi:10.1145/2582112 , isbn =

    2014 doi

  143. [151]

    J. Matou. Near-Optimal Separators in String Graphs , journal =

  144. [152]

    Fox and J

    J. Fox and J. Pach , Date-Added =. A Separator Theorem for String Graphs and its Applications , Volume =. Combinatorics, Probability

  145. [153]

    Davies and C

    J. Davies and C. Keller and L. Kleist and S. Smorodinsky and B. Walczak , title =

  146. [154]

    Keller and A

    C. Keller and A. Rok and S. Smorodinsky , title =. Discret. Comput. Geom. , volume =

  147. [155]

    Biniaz and J

    A. Biniaz and J. L. De Carufel and A. Maheshwari and M. Smid and S. Smorodinsky and M. Stojakovic , title =

  148. [156]

    Jartoux and C

    B. Jartoux and C. Keller and S. Smorodinsky and Y. Yuditsky , title =

  149. [157]

    Chazelle , title =

    B. Chazelle , title =. J

  150. [158]

    W. G. Brown , journal=. On graphs that do not contain a

  151. [159]

    W. T. Gowers , journal=. Hypergraph regularity and the multidimensional

  152. [160]

    Fox and J

    J. Fox and J. Pach , journal=. Separator theorems and

  153. [161]

    Tomon , title =

    I. Tomon , title =. Random Struct. Algorithms , volume =

  154. [162]

    D. K. Induced Subdivisions In. Combinatorica , volume =

  155. [163]

    A. D. Scott and P. D. Seymour and S. Spirkl , title =. J. Graph Theory , volume =

  156. [164]

    Fox and J

    J. Fox and J. Pach. Coloring K k-free intersection graphs of geometric objects in the plane. European Journal of Combinatorics. 2012. doi:https://doi.org/10.1016/j.ejc.2011.09.021

    2012 doi

  157. [165]

    Fox and J

    J. Fox and J. Pach and A. Suk , Date-Added =. The Number of Edges in k-Quasi-planar Graphs , Volume =

  158. [166]

    T. M. Chan , title =. Symposuim on Computational Geometry 2012, SoCG '12, Chapel Hill, NC, USA, June 17-20, 2012 , pages =

    2012

  159. [167]

    Krawczyk and B

    T. Krawczyk and B. Walczak , Date-Added =. Coloring Relatives of Interval Overlap Graphs via On-line Games , Year =. Automata, Languages, and Programming - 41st International Colloquium,

  160. [168]

    Balas and C

    K. Balas and C. D. T \' o th. On the number of anchored rectangle packings for a planar point set. Theoretical Computer Science. 2016. doi:https://doi.org/10.1016/j.tcs.2016.03.007

    2016 doi

  161. [169]

    Jartoux and C

    B. Jartoux and C. Keller and S. Smorodinsky and Y. Yuditsky , title =. Discrete and Computational Geometry , volume =

  162. [170]

    Tight Upper Bounds for the Discrepancy of Half-Spaces , journal =

    Jir. Tight Upper Bounds for the Discrepancy of Half-Spaces , journal =

  163. [171]

    Keller and S

    C. Keller and S. Smorodinsky , title =. Proceedings of SODA 2018 , pages =

    2018

  164. [172]

    and Ueckerdt, T

    Chaplick, S. and Ueckerdt, T. Planar Graphs as VPG-Graphs. Graph Drawing. 2013

    2013

  165. [173]

    Felsner and K

    S. Felsner and K. Knauer and G. B. Mertzios and T. Ueckerdt. Intersection graphs of L -shapes and segments in the plane. Discrete Applied Mathematics. 2016. doi:https://doi.org/10.1016/j.dam.2016.01.028

    2016 doi

  166. [174]

    J. Matou. Geometry, Structure and Randomness in Combinatorics , Title =

  167. [175]

    A. V. Kostochka and J. Kratochv. Covering and coloring polygon-circle graphs , journal =

  168. [176]

    A. V. Kostochka and J. Nesetril , title =. Eur. J. Comb. , volume =

  169. [177]

    Kostochka, A. V. , TITLE =. Trudy Inst. Mat. (Novosibirsk) , FJOURNAL =. 1988 , NUMBER =

    1988

  170. [178]

    Krawczyk and A

    T. Krawczyk and A. Pawlik and B. Walczak , title =. Discrete Comput. Geom. , volume =

  171. [179]

    A. Gy. On the chromatic number of multiple interval graphs and overlap graphs , Volume =. Discrete Mathematics , Number =

  172. [180]

    J. P. Burling , Date-Added =. PhD thesis, University of Colorado , Title =

  173. [181]

    Asplund and B

    E. Asplund and B. Grunbaum , Date-Added =. On a coloring problem , Volume =. Math. Scand. , Pages =

  174. [182]

    McGuinness , Date-Added =

    S. McGuinness , Date-Added =. Colouring Arcwise Connected Sets in the Plane. Graphs and Combinatorics , Number =

  175. [183]

    Rok and B

    A. Rok and B. Walczak , title =. 30th Annual Symposium on Computational Geometry, SOCG'14, Kyoto, Japan, June 08 - 11, 2014 , pages =

    2014

  176. [184]

    Rok and B

    A. Rok and B. Walczak , title =. 33rd International Symposium on Computational Geometry, SoCG 2017, July 4-7, 2017, Brisbane, Australia , pages =

    2017

  177. [185]

    Fox and J

    J. Fox and J. Pach , Date-Added =. Applications of a New Separator Theorem for String Graphs , Volume =. Combinatorics, Probability

  178. [186]

    Fox and J

    J. Fox and J. Pach , Journal =. String graphs and incomparability graphs , Volume =

  179. [187]

    On the maximum number of edges in quasi-planar graphs , Volume =

    Eyal Ackerman and G. On the maximum number of edges in quasi-planar graphs , Volume =. J. Comb. Theory, Ser

  180. [188]

    N. H. Mustafa and S. Ray , title =. Discret. Comput. Geom. , volume =

  181. [189]

    Dutta and A

    K. Dutta and A. Ghosh and B. Jartoux and N. H. Mustafa , title =. Discret. Comput. Geom. , volume =

  182. [190]

    Dutta and A

    K. Dutta and A. Ghosh and S. Moran , title =. Proceedings of

  183. [191]

    P. K. Agarwal and B. Aronov and J. Pach and R. Pollack and M. Sharir , Date-Added =. Quasi-Planar Graphs Have a Linear Number of Edges , Volume =. Combinatorica , Pages =

  184. [192]

    Pawlik and J

    A. Pawlik and J. Kozik and T. Krawczyk and M. Lason and P. Micek and W.T. Trotter and B. Walczak , title =. J. Comb. Theory, Ser

  185. [193]

    , TITLE =

    Sudakov, B. , TITLE =. Proc

  186. [194]

    Conflict-Free Coloring and its Applications, Geometry --- Intuitive, Discrete, and Convex

    Smorodinsky, S. Conflict-Free Coloring and its Applications, Geometry --- Intuitive, Discrete, and Convex. 2013. doi:10.1007/978-3-642-41498-5_12

    2013 doi

  187. [195]

    Geometry --- Intuitive, Discrete, and Convex: A Tribute to L

    Survey on decomposition of multiple coverings , author=. Geometry --- Intuitive, Discrete, and Convex: A Tribute to L. 2013 , publisher=

    2013

  188. [196]

    Milojevi

    A. Milojevi. Incidence bounds via extremal graph theory, available at arXiv: 2401.06670 , Year =

    arXiv

  189. [197]

    Tidor and H-H

    J. Tidor and H-H. H. Yu , Title =

  190. [198]

    Du and R

    X. Du and R. McCarty , Title =

  191. [199]

    Smorodinsky , Title =

    S. Smorodinsky , Title =

  192. [200]

    Hunter and A

    Z. Hunter and A. Milojevi. K

  193. [201]

    Smorodinsky and M

    S. Smorodinsky and M. Stojakovi. Polychromatic coloring of subsets, preprint , Year =

  194. [202]

    Keller and S

    C. Keller and S. Smorodinsky , title =. SoCG 2024 , series =

    2024

  195. [203]

    Welzl , title =

    E. Welzl , title =. Proceedings of the Fourth Annual Symposium on Computational Geometry , pages =

  196. [204]

    Matousek , title =

    J. Matousek , title =. Comput. Geom. , volume =

  197. [205]

    Frankl and A

    N. Frankl and A. Kupavskii , Title =

  198. [206]

    Alon and D

    N. Alon and D. Haussler and E. Welzl , title =. Proceedings of

  199. [207]

    Pach , title =

    J. Pach , title =. Proceedings of the International Congress of Mathematicians 2014 (ICM 2014) , pages =

    2014

  200. [208]

    Blumer and A

    A. Blumer and A. Ehrenfeucht and D. Haussler and M. K. Warmuth , title =. J

  201. [209]

    N. H. Mustafa and J. Pach , title =. J. Comb. Theory, Ser

  202. [210]

    R. J. Lipton and R. E. Tarjan , Bibsource =. Applications of a Planar Separator Theorem , Volume =

  203. [211]

    Do , Journal =

    T. Do , Journal =. Representation complexities of semi-algebraic graphs , Volume =

  204. [212]

    , Journal =

    Sauer, N. , Journal =. On the density of families of sets , Year =

  205. [213]

    , Journal =

    Shelah, S. , Journal =. A combinatorial problem; stability and order for models and theories in infinitary languages , Year =

  206. [214]

    Vapnik, V. N. and. The uniform convergence of frequencies of the appearance of events to their probabilities , Year =. Theory of Probability & Its Applications , Number =

  207. [215]

    Do , title =

    T. Do , title =. J. Combin. Th., Ser. A , volume =

  208. [216]

    P. Erd. Ramsey. Mat. Lapok , volume =

  209. [217]

    Gargano and A

    L. Gargano and A. A. Rescigno , Bibsource =. Complexity of conflict-free colorings of graphs , Url =. 2015 , Bdsk-Url-1 =. doi:10.1016/j.tcs.2014.11.029 , Journal =

    2015 doi

  210. [218]

    Fox and J

    J. Fox and J. Pach and A. Suk , Booktitle = SOCG_2017, Pages =. Erdos-

  211. [219]

    Cheilaris and B

    P. Cheilaris and B. Keszegh and D. P\'. Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs , journal =. 2013 , doi =

    2013

  212. [220]

    Fekete and P

    S.P. Fekete and P. Keldenich , title =. 28th International Symposium on Algorithms and Computation,. 2017 , crossref =. doi:10.4230/LIPIcs.ISAAC.2017.31 , timestamp =

    2017 doi

  213. [221]

    2017 , url =

    28th International Symposium on Algorithms and Computation,. 2017 , url =

    2017

  214. [222]

    Keller and S

    C. Keller and S. Smorodinsky , title =. Proceedings of the Twenty-Ninth Annual

  215. [223]

    2018 , url =

    Proceedings of the Twenty-Ninth Annual. 2018 , url =. doi:10.1137/1.9781611975031 , isbn =

    2018 doi

  216. [224]

    de Berg and M

    M. de Berg and M. van Kreveld and M. Overmars and O. Schwarzkopf , Edition =. Computational Geometry: Algorithms and Applications , Url =

  217. [225]

    R. L. Graham and B. L. Rothschild and J. H. Spencer , Edition =. Ramsey Theory , Year =

  218. [226]

    P. Erd. Partition relations for cardinal numbers , journal =. 1965 , pages =

    1965

  219. [227]

    P. Erd. Combinatorial theorems on classifications of subsets of a given set , journal =. 1952 , pages =

    1952

  220. [228]

    Multicolor

    Maria Axenovich and Andr. Multicolor. Discret. Math. , volume =

  221. [229]

    Chen and J

    X. Chen and J. Pach and M. Szegedy and G. Tardos , title =. Random Struct. Algorithms , volume =

  222. [230]

    Conlon and J

    D. Conlon and J. Fox and B. Sudakov , title =. Discret. Appl. Math. , volume =

  223. [231]

    Sweet , title =

    Harold Fredricksen and Melvin M. Sweet , title =. Electron. J. Comb. , volume =

  224. [232]

    Reay , title =

    John R. Reay , title =. Israel Journal of Mathematics , volume =. 1979 , doi =

    1979

  225. [233]

    Perles and Moriah Sigron , title =

    Micha A. Perles and Moriah Sigron , title =. Israel Journal of Mathematics , volume =. 2016 , doi =

    2016

  226. [234]

    A colored version of

    Imre B. A colored version of. J. Lond. Math. Soc. , volume =. 1992 , doi =

    1992

  227. [235]

    The colored

    Rade T. The colored. J. Combin. Theory Ser. A , volume =. 1992 , doi =

    1992

  228. [236]

    Pavle V. M. Blagojevi. Optimal bounds for the colored. J. Eur. Math. Soc. , volume =. 2015 , doi =

    2015

  229. [237]

    Discrete Geometry and Convexity in Honour of Imre B

    Gil Kalai , title =. Discrete Geometry and Convexity in Honour of Imre B. 2017 , isbn =

    2017

  230. [238]

    Patrick Assouad , title =. Ann. Inst. Fourier (Grenoble) , volume =. 1983 , doi =

    1983

  231. [239]

    Equal coefficients and tolerance in coloured

    Pablo Sober. Equal coefficients and tolerance in coloured. Combinatorica , volume =. 2015 , doi =

    2015

  232. [240]

    L. M. Bregman , title =. Soviet Math. Dokl. , volume =. 1973 , note =

    1973

  233. [241]

    N. A. Sherwani , Edition =. Algorithms for VLSI Physical Design Automation , Url =

  234. [242]

    Alon , Booktitle =

    N. Alon , Booktitle =. Restricted colorings of graphs , Year =

  235. [243]

    P. Erd. Euclidean. A. Hajnal, R. Rado, and V. S´os, editors, Infinite Sets I, North-Holland, Amsterdam (Colloq. Math. Soc. Janos Bolyai, Vol. 10) , Pages =

  236. [244]

    Imbalances in k-colorations , journal =

    Paul Erd. Imbalances in k-colorations , journal =

  237. [245]

    Ackerman and B

    E. Ackerman and B. Keszegh and D. P. Coloring. Comput. Geom. , volume =

  238. [246]

    Axenovich and J

    M. Axenovich and J. L. Goldwasser and R. Hansen and B. Lidick. Polychromatic colorings of complete graphs with respect to 1-, 2-factors and. J. Graph Theory , volume =

  239. [247]

    P. Erd. Split and balanced colorings of complete graphs , journal =

  240. [248]

    Cochand and G

    M. Cochand and G. K. On a graph colouring problem , journal =

  241. [249]

    F. R. K. Chung , title =. J. Number Theory , volume =

  242. [250]

    Dey and Thomas Kalinowski and Marco Molinaro and Fabian Rigterink , title =

    Natashia Boland and Santanu S. Dey and Thomas Kalinowski and Marco Molinaro and Fabian Rigterink , title =. Math. Program. , volume =

  243. [251]

    Fan R. K. Chung and Prasad Tetali , title =

  244. [252]

    F. R. K. Chung and R. Graham , title =. J. Amer. Math. Soc. , volume =

  245. [253]

    Cutting a graph into two dissimilar halves , journal =

    Paul Erd. Cutting a graph into two dissimilar halves , journal =

  246. [254]

    Explicit codes with low covering radius , journal =

    J. Explicit codes with low covering radius , journal =

  247. [255]

    J. L. Goldwasser and B. Lidick. Polychromatic colorings on the hypercube , journal =

  248. [256]

    J. L. Goldwasser and R. Hansen , title =. Discret. Math. , volume =

  249. [257]

    Conlon and J

    D. Conlon and J. Fox and W. I. Gasarch and D. G. Harris and D. Ulrich and S. Zbarsky , title =

  250. [258]

    Lefmann and V

    H. Lefmann and V. R. Multicolored Subsets in Colored Hypergraphs , journal =

  251. [259]

    K. S. Sarkaria , title =. J. Combin. Theory Ser. A , volume =

  252. [260]

    K. S. Sarkaria , title =. Illinois J. Math. , volume =

  253. [261]

    K. S. Sarkaria , title =. Trans. Amer. Math. Soc. , volume =

  254. [262]

    Nesetril and P

    J. Nesetril and P. Valtr , title =. Combin. Probab. Comput. , volume =

  255. [263]

    Nesetril and P

    J. Nesetril and P. Valtr , title =. J. Comb. Theory, Ser

  256. [264]

    Balko and J

    M. Balko and J. Kyn. Induced. Electron. J. Comb. , volume =

  257. [265]

    P. K. Agarwal and J. Erickson , Booktitle =. Geometric range searching and its relatives , Year =

  258. [266]

    T. M. Chan and D. W. Zheng , title =. Proceedings of

  259. [267]

    and Chernikov, A

    Basit, A. and Chernikov, A. and Starchenko, S. and Tao, T. and Tran, C.-M. , TITLE =. Forum Math. Sigma , VOLUME =. 2021 , PAGES =

    2021

  260. [268]

    Tomon and D

    I. Tomon and D. Zakharov , title =. Comb. Probab. Comput. , volume =

  261. [269]

    Alon and J

    N. Alon and J. H. Spencer , Edition =. The Probabilistic Method , Year =

  262. [270]

    D. B. West , Edition =

  263. [271]

    Lectures on Discrete Geometry , Year =

    Matou. Lectures on Discrete Geometry , Year =

  264. [272]

    Geometric Discrepancy , Year =

    Matou. Geometric Discrepancy , Year =

  265. [273]

    Borodin and R

    A. Borodin and R. El Yaniv , Publisher =. Online Computation and Competitive Analysis , Year =

  266. [274]

    Alon and S

    N. Alon and S. Smorodinsky , Journal = INTJC, Number =. Conflict-Free colorings of Shallow Discs , Volume =

  267. [275]

    Benzer , Journal =

    S. Benzer , Journal =. On the topology of the genetic fine structure , Volume =

  268. [276]

    Ehrlich and S

    G. Ehrlich and S. Even and R. E. Tarjan , Journal =. Intersection graphs of curves in the plane , Volume =

  269. [277]

    Kratochv

    J. Kratochv. String graphs requiring exponential representations , Volume =. J. Combin. Theory Ser. B , Pages =

  270. [278]

    Pach and G

    J. Pach and G. T. Recognizing string graphs is decidable , Volume =

  271. [279]

    Chojanski , Journal =

    Ch. Chojanski , Journal =

  272. [280]

    W. T. Tutte , Journal =. Toward a theory of crossing numbers , Volume =

  273. [281]

    R. P. Dilworth , Journal =. A Decomposition Theorem for Partially Ordered Sets , Volume =

  274. [282]

    Schaefer and E

    M. Schaefer and E. Sedgwick and D. Recognizing string graphs in. J. Comput. System Sci., special issue of STOC'2002 , Pages =

    2002

  275. [283]

    Haussler and E

    D. Haussler and E. Welzl , Journal = DCG, Keywords =

  276. [284]

    Keszegh , School =

    B. Keszegh , School =. Combinatorial and computational problems about points in the plane , Year =

  277. [285]

    Keszegh , Booktitle =

    B. Keszegh , Booktitle =. Weak Conflict-Free Colorings of Point Sets and Simple Regions , Year =

  278. [286]

    J. H. Spencer and A. Srinivasan and P. Tetali , Howpublished =. The Discrepancy of Permutation Families , Year =

  279. [287]

    Ackerman and B

    E. Ackerman and B. Keszegh and D. P. On tangencies among planar curves with an application to coloring. 2021 , Pages =

    2021

  280. [288]

    and Pinchasi, R

    Buzaglo, S. and Pinchasi, R. and Rote, G. , year =. Topological Hypergraphs , isbn =. Thirty Essays on Geometric Graph Theory , doi =

  281. [289]

    Keller and S

    C. Keller and S. Smorodinsky , Title =

  282. [290]

    Keszegh , title =

    B. Keszegh , title =. Proceedings of SoCG 2018 , pages =. 2018 , crossref =. doi:10.4230/LIPIcs.SoCG.2018.52 , timestamp =

    2018 doi

  283. [291]

    2018 , url =

    34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary , series =. 2018 , url =

    2018

  284. [292]

    T. M. Chan , title =

  285. [293]

    Arya and G

    S. Arya and G. Dias da Fonseca and D. M. Mount , title =

  286. [294]

    Alon and G

    N. Alon and G. R. Brightwell and H. A. Kierstead and A. V. Kostochka and P. Winkler , title =. J. Comb. Theory, Ser

  287. [295]

    Chudnovsky and A

    M. Chudnovsky and A. Scott and P. Seymour , Howpublished =. Induced subgraphs of graphs with large chromatic number

  288. [296]

    Berge , Isbn =

    C. Berge , Isbn =. Graphs and Hypergraphs , Year =

  289. [297]

    Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability , Year =

    B\'. Combinatorics: Set Systems, Hypergraphs, Families of Vectors, and Combinatorial Probability , Year =

  290. [298]

    Appel and W

    K. Appel and W. Haken , Journal = ILLJM, Pages =. Every planar map is 4-colorable - 1: Discharging , Volume =

  291. [299]

    Appel and W

    K. Appel and W. Haken , Journal = ILLJM, Pages =. Every planar map is 4-colorable - 2: Reducibility , Volume =

  292. [300]

    A combinatorial theorem in plane geometry , Year =

    Vasek Chv\'. A combinatorial theorem in plane geometry , Year =. J. Combin. Theory , Number =

Pith tools

Reviewed July 14, 2026 · model on record in the stance chip above.