On the public citation graph

Transversals of 2-intervals, a topological approach

0 signed · 45 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/978-1-4684-9322-1_5openalex-snapshot
Homology
inferredcites →https://doi.org/10.1007/978-3-662-02021-0openalex-snapshot
Topologie I
inferredcites →https://doi.org/10.1007/bf01844847openalex-snapshot
On point covers of multiple intervals and axis-parallel rectangles
inferredcites →https://doi.org/10.1016/0196-8858(85)90021-1openalex-snapshot
Homotopy properties of greedoids
inferredcites →https://doi.org/10.1515/9781400877492openalex-snapshot
Foundations of Algebraic Topology
inferredcites →https://doi.org/10.4064/fm-35-1-217-234openalex-snapshot
On the imbedding of systems of compacta in simplicial complexes

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-0348-8898-1_15openalex-snapshot
Transversals of d-intervals — Comparing three Approaches
inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_10openalex-snapshot
Using Brouwer’s Fixed Point Theorem
inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_30openalex-snapshot
k-Gap Interval Graphs
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/bf01844847openalex-snapshot
On point covers of multiple intervals and axis-parallel rectangles
inferred← citeshttps://doi.org/10.1007/pl00009315openalex-snapshot
Transversals of d-Intervals
inferred← citeshttps://doi.org/10.1007/pl00009349openalex-snapshot
Piercing d -Intervals
inferred← citeshttps://doi.org/10.1007/pl00009408openalex-snapshot
A Helly Type Conjecture
inferred← citeshttps://doi.org/10.1007/pl00009421openalex-snapshot
Intersection Properties of Families of Convex (n,d)-Bodies
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-001-0037-8openalex-snapshot
Lower Bounds on the Transversal Numbers of d-Intervals
inferred← citeshttps://doi.org/10.1007/s00454-017-9923-6openalex-snapshot
Edge-Covers in d-Interval Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00454-022-00391-yopenalex-snapshot
A Family of Convex Sets in the Plane Satisfying the (4, 3)-Property can be Pierced by Nine Points
inferred← citeshttps://doi.org/10.1007/s00454-022-00464-yopenalex-snapshot
A Sparse Colorful Polytopal KKM Theorem
inferred← citeshttps://doi.org/10.1007/s00493-005-0001-yopenalex-snapshot
KKM?A Topological Approach For Trees
inferred← citeshttps://doi.org/10.1007/s00493-016-3174-7openalex-snapshot
Fractional covers and matchings in families of weighted d-intervals
inferred← citeshttps://doi.org/10.1007/s00493-018-3891-1openalex-snapshot
Colorful Coverings of Polytopes and Piercing Numbers of Colorful d-Intervals
inferred← citeshttps://doi.org/10.1007/s00493-021-4808-yopenalex-snapshot
Fractionally Balanced Hypergraphs and Rainbow KKM Theorems
inferred← citeshttps://doi.org/10.1007/s004930200016openalex-snapshot
A Tree Version of Kőnig's Theorem
inferred← citeshttps://doi.org/10.1016/j.disc.2018.12.019openalex-snapshot
The (p,q) property in families of d -intervals and d -trees
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.jcta.2005.07.002openalex-snapshot
Intersection reverse sequences and geometric applications
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.04.004openalex-snapshot
Cliques in the union of graphs
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2019.06.007openalex-snapshot
Piercing numbers in approval voting
inferred← citeshttps://doi.org/10.1016/s0012-365x(02)00427-2openalex-snapshot
Covering a hypergraph of subgraphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00816-2openalex-snapshot
Algebraic testing and weight distributions of codes
inferred← citeshttps://doi.org/10.1070/rm2008v063n06abeh004578openalex-snapshot
Topological methods in combinatorial geometry
inferred← citeshttps://doi.org/10.1112/plms.12250openalex-snapshot
Growth rates of permutation classes: from countable to uncountable
inferred← citeshttps://doi.org/10.1145/1721837.1721856openalex-snapshot
Optimization problems in multiple-interval graphs
inferred← citeshttps://doi.org/10.31274/td-20240617-40openalex-snapshot
KKM theorems and applications to problems in discrete geometry
inferred← citeshttps://doi.org/10.37236/5532openalex-snapshot
Red-Blue Clique Partitions and (1-1)-Transversals
inferred← citeshttps://doi.org/10.4213/rm9244openalex-snapshot
Топологические методы в комбинаторной геометрии
inferred← citeshttps://doi.org/10.46298/dmtcs.1328openalex-snapshot
An Erd\H{o}s--Hajnal analogue for permutation classes
inferred← citeshttps://doi.org/10.48550/arxiv.0909.0604openalex-snapshot
KKM-type theorems for products of simplices and cutting sets and measures by straight lines
inferred← citeshttps://doi.org/10.48550/arxiv.1112.3244openalex-snapshot
k-Gap Interval Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1402.2064openalex-snapshot
Fractional covers and matchings in families of weighted $d$-intervals
inferred← citeshttps://doi.org/10.48550/arxiv.1703.02939openalex-snapshot
The $(p,q)$ property in families of $d$-intervals and $d$-trees
inferred← citeshttps://doi.org/10.48550/arxiv.math/9912134openalex-snapshot
A tree version of Konig's theorem
inferred← citeshttps://doi.org/10.5555/1283383.1283412openalex-snapshot
Optimization problems in multiple-interval 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.