On the public citation graph
Degrees of freedom versus dimension for containment orders
0 signed · 56 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/bf00143891openalex-snapshot
Circle orders, N-gon orders and the crossing number
inferredcites →https://doi.org/10.1007/bf00337885openalex-snapshot
Angle orders, regular n-gon orders and the crossing number
inferredcites →https://doi.org/10.1007/bf02579362openalex-snapshot
How many atoms can be defined by boxes?
inferredcites →https://doi.org/10.1090/s0002-9947-1968-0226281-1openalex-snapshot
Lower Bounds for Approximation by Nonlinear Manifolds
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb22452.xopenalex-snapshot
Containment Graphs, Posets, and Related Classes of Graphs
inferredcites →https://doi.org/10.1112/s0025579300013875openalex-snapshot
The number of polytopes, configurations and real matroids
inferredcites →https://doi.org/10.24517/00011543openalex-snapshot
On the Dimension of Partially Ordered Sets.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.20266openalex-snapshot
Hereditary properties of combinatorial structures: Posets and oriented graphs
inferred← citeshttps://doi.org/10.1002/jgt.3190140605openalex-snapshot
Ramsey graphs cannot be defined by real polynomials
inferred← citeshttps://doi.org/10.1002/jgt.3190150603openalex-snapshot
General results on tolerance intersection graphs
inferred← citeshttps://doi.org/10.1006/aama.1998.0604openalex-snapshot
Combinatorics of Topological Posets
inferred← citeshttps://doi.org/10.1007/978-3-319-24298-9_15openalex-snapshot
The mathematics of causal sets
inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_9openalex-snapshot
Generalized Polychotomic Encoding: A Very Short Bit-Vector Encoding of Tree Hierarchies
inferred← citeshttps://doi.org/10.1007/978-3-662-44465-8_26openalex-snapshot
Intersection Graphs of L-Shapes and Segments in the Plane
inferred← citeshttps://doi.org/10.1007/978-94-009-2639-4_11openalex-snapshot
Partial Orders and Euclidean Geometry
inferred← citeshttps://doi.org/10.1007/bf00337885openalex-snapshot
Angle orders, regular n-gon orders and the crossing number
inferred← citeshttps://doi.org/10.1007/bf01110544openalex-snapshot
Spherical containment and the Minkowski dimension of partial orders
inferred← citeshttps://doi.org/10.1007/bf01236509openalex-snapshot
Irrepresentability of short semilattices by euclidean subspaces
inferred← citeshttps://doi.org/10.1007/s11083-009-9135-7openalex-snapshot
The Complexity of Embedding Orders into Small Products of Chains
inferred← citeshttps://doi.org/10.1007/s11083-023-09628-8openalex-snapshot
Separability, Boxicity, and Partial Orders
inferred← citeshttps://doi.org/10.1016/0012-365x(91)90014-sopenalex-snapshot
The interval inclusion number of a partially ordered set
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50010-5openalex-snapshot
10.1016/b978-044488002-4/50010-5
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50034-8openalex-snapshot
10.1016/b978-044488002-4/50034-8
inferred← citeshttps://doi.org/10.1016/j.aim.2021.107593openalex-snapshot
On the speed of algebraically defined graph classes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2022.101924openalex-snapshot
Many order types on integer grids of polynomial size
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.028openalex-snapshot
Intersection graphs of L-shapes and segments in the plane
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00366-6openalex-snapshot
Containment orders for similar ellipses with a common center
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00049-6openalex-snapshot
Dot product representations of graphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00314-8openalex-snapshot
Finite three dimensional partial orders which are not sphere orders
inferred← citeshttps://doi.org/10.1016/s0166-218x(00)00180-3openalex-snapshot
Ray shooting from convex ranges
inferred← citeshttps://doi.org/10.1017/cbo9780511662119.009openalex-snapshot
New Perspectives on Interval Orders and Interval Graphs
inferred← citeshttps://doi.org/10.1023/a:1006110326269openalex-snapshot
Geometric Containment Orders: A Survey
inferred← citeshttps://doi.org/10.1090/conm/558openalex-snapshot
Model Theoretic Methods in Finite Combinatorics
inferred← citeshttps://doi.org/10.1090/conm/558/11054openalex-snapshot
Some examples of universal and generic partial orders
inferred← citeshttps://doi.org/10.1090/dimacs/049/24openalex-snapshot
Ramsey theory and partially ordered sets
inferred← citeshttps://doi.org/10.1137/0402021openalex-snapshot
Geometric Containment and Partial Orders
inferred← citeshttps://doi.org/10.1137/s0895480191197210openalex-snapshot
Nonredundant 1’s in $\Gamma $-Free Matrices
inferred← citeshttps://doi.org/10.1145/1806689.1806773openalex-snapshot
An optimal ancestry scheme and small universal posets
inferred← citeshttps://doi.org/10.1145/2794076openalex-snapshot
An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets
inferred← citeshttps://doi.org/10.1145/3397476openalex-snapshot
Coin Flipping in Dynamic Programming Is Almost Useless
inferred← citeshttps://doi.org/10.48550/arxiv.1405.1476openalex-snapshot
Intersection Graphs of L-Shapes and Segments in the Plane
inferred← citeshttps://doi.org/10.48550/arxiv.math/9801147openalex-snapshot
Combinatorics of Topological Posets:\ Homotopy complementation formulas
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.