On the public citation graph
A Purely Combinatorial Proof of the Hadwiger Debrunner $(p,q)$ Conjecture
0 signed · 23 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01229745openalex-snapshot
d-Collapsing and nerves of families of convex sets
inferredcites →https://doi.org/10.1007/bf01898794openalex-snapshot
Über eine Variante zum Hellyschen Satz
inferredcites →https://doi.org/10.1007/bf02761162openalex-snapshot
Intersection patterns of convex sets
inferredcites →https://doi.org/10.1016/0001-8708(92)90052-mopenalex-snapshot
Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem
inferredcites →https://doi.org/10.1017/s0963548300000225openalex-snapshot
Point Selections and Weak ε-Nets for Convex Hulls
inferredcites →https://doi.org/10.1145/73393.73397openalex-snapshot
Partition trees for triangle counting and other range searching problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-642-55566-4_16openalex-snapshot
A Survey of the Hadwiger-Debrunner (p, q)-problem
inferred← citeshttps://doi.org/10.1007/s00454-015-9723-9openalex-snapshot
A Variant of the Hadwiger–Debrunner (p, q)-Problem in the Plane
inferred← citeshttps://doi.org/10.1007/s00454-018-0048-3openalex-snapshot
From a (p, 2)-Theorem to a Tight (p, q)-Theorem
inferred← citeshttps://doi.org/10.1007/s004930100020openalex-snapshot
Convex Sets in the Plane with Three of Every Four Meeting
inferred← citeshttps://doi.org/10.1007/s10801-017-0807-xopenalex-snapshot
Antipodal covers of distance-transitive generalized polygons
inferred← citeshttps://doi.org/10.1007/s11009-014-9428-1openalex-snapshot
Bivariate Issues in Leader Election Algorithms with Marshall-Olkin Limit Distribution
inferred← citeshttps://doi.org/10.1007/s11856-018-1685-1openalex-snapshot
Improved bounds on the Hadwiger–Debrunner numbers
inferred← citeshttps://doi.org/10.1016/j.jnt.2017.01.018openalex-snapshot
Multiple zeta values and Euler sums
inferred← citeshttps://doi.org/10.1049/iet-com.2018.5602openalex-snapshot
Mixed construction of OOC for optical code division multiple access networks
inferred← citeshttps://doi.org/10.1090/conm/685/13718openalex-snapshot
Helly’s theorem: New variations and applications
inferred← citeshttps://doi.org/10.1137/1.9781611974782.148openalex-snapshot
On Max-Clique for intersection graphs of sets and the Hadwiger-Debrunner numbers
inferred← citeshttps://doi.org/10.2989/16073606.2015.1023987openalex-snapshot
The asymmetric leader election algorithm: Number of survivors near the end of the game
inferred← citeshttps://doi.org/10.37236/751openalex-snapshot
The Maximum Piercing Number for some Classes of Convex Sets with the $(4,3)$-property
inferred← citeshttps://doi.org/10.5555/3039686.3039834openalex-snapshot
On max-clique for intersection graphs of sets and the hadwiger-debrunner numbers
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.