On the public citation graph
Intersection properties of boxes. Part I: An upper-bound theorem
0 signed · 35 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/bf00181472openalex-snapshot
An Upper-Bound theorem for families of convex sets
inferredcites →https://doi.org/10.1007/bf02579232openalex-snapshot
Intersection properties of boxes in R d
inferredcites →https://doi.org/10.1007/bf02761162openalex-snapshot
Intersection patterns of convex sets
inferredcites →https://doi.org/10.1007/bf03008396openalex-snapshot
Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner
inferredcites →https://doi.org/10.1016/0012-365x(76)90069-8openalex-snapshot
The maximum number of q-cliques in a graph with no p-clique
inferredcites →https://doi.org/10.1016/0012-365x(79)90155-9openalex-snapshot
A Turán type problem for interval graphs
inferredcites →https://doi.org/10.1016/0012-365x(84)90080-3openalex-snapshot
The structure of rectangle families dividing the plane into maximum number of atoms
inferredcites →https://doi.org/10.1016/s0195-6698(85)80029-9openalex-snapshot
A Simple Proof of the Upper Bound Theorem
inferredcites →https://doi.org/10.1090/s0002-9939-1979-0532152-6openalex-snapshot
A problem of geometry in ${\bf R}\sp{n}$
inferredcites →https://doi.org/10.1112/s0025579300002850openalex-snapshot
The maximum numbers of faces of a convex polytope
inferredcites →https://doi.org/10.4064/cm-2-2-130-135openalex-snapshot
Sur l'indépendance de domaines simples dans l'espace euclidien à n dimensions
inferredcites →https://doi.org/10.4153/cjm-1980-063-4openalex-snapshot
Boxes in Rn —A ‘Fractional’ Theorem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02772945openalex-snapshot
Intersection properties of boxes part II: Extremal families
inferred← citeshttps://doi.org/10.1007/s00454-022-00468-8openalex-snapshot
Fractional Helly Theorem for Cartesian Products of Convex Sets
inferred← citeshttps://doi.org/10.1007/s11856-008-0024-3openalex-snapshot
Face vectors of flag complexes
inferred← citeshttps://doi.org/10.1016/b978-0-444-89596-7.50017-1openalex-snapshot
Helly, Radon, and Carathéodory Type Theorems
inferred← citeshttps://doi.org/10.1016/j.aam.2021.102217openalex-snapshot
Discrete quantitative Helly-type theorems with boxes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.09.001openalex-snapshot
Acknowledgement of priority — A fractional Helly theorem for boxes
inferred← citeshttps://doi.org/10.1016/j.jcta.2009.04.003openalex-snapshot
A Kruskal–Katona type theorem for graphs
inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105465openalex-snapshot
Quantitative combinatorial geometry for concave functions
inferred← citeshttps://doi.org/10.1017/s0963548312000429openalex-snapshot
Turán and Ramsey Properties of Subcube Intersection Graphs
inferred← citeshttps://doi.org/10.1112/s0025579300000176openalex-snapshot
The Upper‐Bound Theorem for Families of Boxes in ℝ d
inferred← citeshttps://doi.org/10.1137/100818170openalex-snapshot
Cohen–Macaulay Graphs and Face Vectors of Flag Complexes
inferred← citeshttps://doi.org/10.1137/120894324openalex-snapshot
From Flag Complexes to Banner Complexes
inferred← citeshttps://doi.org/10.1137/24m1658358openalex-snapshot
Extensions of Discrete Helly Theorems for Boxes
inferred← citeshttps://doi.org/10.1177/29498732261469486openalex-snapshot
Trustworthy Knowledge Base Embeddings: A Foundational Study of Box Semantics
inferred← citeshttps://doi.org/10.2140/involve.2010.3.93openalex-snapshot
On (2,3)-agreeable box societies
inferred← citeshttps://doi.org/10.5802/igt.17openalex-snapshot
Polynomial Gyárfás–Sumner conjecture for graphs of bounded boxicity
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.