On the public citation graph

The Maximum Piercing Number for some Classes of Convex Sets with the $(4,3)$-property

https://doi.org/10.37236/751
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-46885-4_45openalex-snapshot
Some Ideal Secret Sharing Schemes
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_5openalex-snapshot
On the Abstract Properties of Linear Dependence1
inferredcites →https://doi.org/10.1007/bf00125203openalex-snapshot
An explication of secret sharing schemes
inferredcites →https://doi.org/10.1007/bf01898794openalex-snapshot
Über eine Variante zum Hellyschen Satz
inferredcites →https://doi.org/10.1007/s004540010040openalex-snapshot
Transversals for Families of Translates of a Two-Dimensional Convex Compact Set
inferredcites →https://doi.org/10.1007/s004930100020openalex-snapshot
Convex Sets in the Plane with Three of Every Four Meeting
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.1016/0095-8956(92)90007-kopenalex-snapshot
On secret-sharing matroids
inferredcites →https://doi.org/10.1023/a:1008216403325openalex-snapshot
Tight Bounds on the Information Rate of Secret Sharing Schemes
inferredcites →https://doi.org/10.1093/qmath/27.4.407openalex-snapshot
A FORBIDDEN MINOR CHARACTERIZATION OF MATROID PORTS
inferredcites →https://doi.org/10.1109/18.887867openalex-snapshot
Secret sharing schemes with bipartite access structure
inferredcites →https://doi.org/10.1109/mark.1979.8817296openalex-snapshot
Safeguarding cryptographic keys
inferredcites →https://doi.org/10.1137/0112059openalex-snapshot
A Solution of the Shannon Switching Game
inferredcites →https://doi.org/10.1145/359168.359176openalex-snapshot
How to share a secret
inferredcites →https://doi.org/10.2307/2315998openalex-snapshot
Combinatorial Geometry in the Plane.
inferredcites →https://doi.org/10.37236/1316openalex-snapshot
A Purely Combinatorial Proof of the Hadwiger Debrunner $(p,q)$ Conjecture

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20453openalex-snapshot
On independent sets in hypergraphs
inferred← citeshttps://doi.org/10.1002/rsa.20552openalex-snapshot
List coloring triangle-free hypergraphs
inferred← citeshttps://doi.org/10.1007/s00453-010-9410-4openalex-snapshot
Piercing Translates and Homothets of a Convex Body
inferred← citeshttps://doi.org/10.1007/s00454-015-9664-3openalex-snapshot
About an Erdős–Grünbaum Conjecture Concerning Piercing of Non-bounded Convex Sets
inferred← citeshttps://doi.org/10.1007/s40590-021-00374-8openalex-snapshot
On transversal numbers of intersecting straight line systems and intersecting segment systems
inferred← citeshttps://doi.org/10.1016/j.akcej.2019.03.014openalex-snapshot
On transversal and 2-packing numbers in uniform linear systems
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111825openalex-snapshot
The geometry and combinatorics of discrete line segment hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113787openalex-snapshot
Bounds on piercing and line-piercing numbers in families of convex sets in the plane
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2019.06.007openalex-snapshot
Piercing numbers in approval voting
inferred← citeshttps://doi.org/10.1137/17m1157088openalex-snapshot
The (2,2) and (4,3) Properties in Families of Fat Sets in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.1509.03696openalex-snapshot
On transversal and $2$-packing numbers in straight line systems on $\mathbb{R}^{2}$
inferred← citeshttps://doi.org/10.48550/arxiv.1707.02254openalex-snapshot
Covering and 2-degree-packing numbers in graphs
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.