On the public citation graph

d-Collapsing and nerves of families of convex sets

0 signed · 89 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/bf01696777openalex-snapshot

Über Systeme von abgeschlossenen Mengen mit gemeinschaftlichen Punkten

inferredcites →https://doi.org/10.1007/bfb0060111openalex-snapshot

Incidence patterns of graphs and complexes

inferredcites →https://doi.org/10.1016/0040-9383(63)90014-4openalex-snapshot

On the dunce hat

inferredcites →https://doi.org/10.1090/pspum/007/0157289openalex-snapshot

Helly’s theorem and its relatives

inferredcites →https://doi.org/10.1112/plms/s2-45.1.243openalex-snapshot

Simplicial Spaces, Nuclei and m -Groups

inferredcites →https://doi.org/10.4064/fm-51-1-45-64openalex-snapshot

Representation of a finite graph by a set of intervals on the real line

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-1-4614-0110-0_28openalex-snapshot

Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey

inferred← citeshttps://doi.org/10.1007/978-1-4939-0626-0_7openalex-snapshot

Regularity of Squarefree Monomial Ideals

inferred← citeshttps://doi.org/10.1007/978-3-030-11521-0_2openalex-snapshot

Regularity of Edge Ideals and Their Powers

inferred← citeshttps://doi.org/10.1007/978-3-030-45247-6_5openalex-snapshot

Problems, Questions, and Inductive Techniques

inferred← citeshttps://doi.org/10.1007/978-3-319-44479-6_17openalex-snapshot

Bounding Helly Numbers via Betti Numbers

inferred← citeshttps://doi.org/10.1007/978-3-642-41714-6_210825openalex-snapshot

upper bound theorem

inferred← citeshttps://doi.org/10.1007/bf00181472openalex-snapshot

An Upper-Bound theorem for families of convex sets

inferred← citeshttps://doi.org/10.1007/bf01158213openalex-snapshot

Convex sets and hypergraphs

inferred← citeshttps://doi.org/10.1007/bf01194303openalex-snapshot

Families of convex sets having convex union

inferred← citeshttps://doi.org/10.1007/bf02574042openalex-snapshot

Bounding the piercing number

inferred← citeshttps://doi.org/10.1007/bf02761162openalex-snapshot

Intersection patterns of convex sets

inferred← citeshttps://doi.org/10.1007/bf02761163openalex-snapshot

Characterization off-vectors of families of convex sets inR d Part I: Necessity of Eckhoff’s conditions

inferred← citeshttps://doi.org/10.1007/bf02941422openalex-snapshot

Die Euler-Charakteristik von Vereinigungen konvexer Mengen im Rd

inferred← citeshttps://doi.org/10.1007/pl00009421openalex-snapshot

Intersection Properties of Families of Convex (n,d)-Bodies

inferred← citeshttps://doi.org/10.1007/s00454-008-9085-7openalex-snapshot

Removing Degeneracy in LP-Type Problems Revisited

inferred← citeshttps://doi.org/10.1007/s00454-008-9091-9openalex-snapshot

Dimension Gaps between Representability and Collapsibility

inferred← citeshttps://doi.org/10.1007/s00454-011-9356-6openalex-snapshot

A Counterexample to Wegner’s Conjecture on Good Covers

inferred← citeshttps://doi.org/10.1007/s00454-013-9559-0openalex-snapshot

Colourful and Fractional (p,q)-theorems

inferred← citeshttps://doi.org/10.1007/s00454-015-9747-1openalex-snapshot

Recognition of Collapsible Complexes is NP-Complete

inferred← citeshttps://doi.org/10.1007/s00454-021-00332-1openalex-snapshot

Representability and Boxicity of Simplicial Complexes

inferred← citeshttps://doi.org/10.1007/s00493-019-4019-yopenalex-snapshot

Rainbow Fractional Matchings

inferred← citeshttps://doi.org/10.1007/s00493-023-00044-5openalex-snapshot

Leray Numbers of Tolerance Complexes

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-022-01164-9openalex-snapshot

The v-number and Castelnuovo–Mumford regularity of graphs

inferred← citeshttps://doi.org/10.1007/s11856-019-1923-1openalex-snapshot

On connectivity of the facet graphs of simplicial complexes

inferred← citeshttps://doi.org/10.1007/s11856-022-2308-4openalex-snapshot

Complexes of graphs with bounded independence number

inferred← citeshttps://doi.org/10.1007/s11856-025-2814-2openalex-snapshot

Enumeration of interval graphs and d-representable complexes

inferred← citeshttps://doi.org/10.1007/s12044-026-00867-4openalex-snapshot

On homological invariants associated to graphs with induced matching number one

inferred← citeshttps://doi.org/10.1007/s13348-019-00250-9openalex-snapshot

Regularity, matchings and Cameron–Walker graphs

inferred← citeshttps://doi.org/10.1007/s40062-023-00334-1openalex-snapshot

Weak cartesian properties of simplicial sets

inferred← citeshttps://doi.org/10.1007/s41980-021-00560-4openalex-snapshot

Algebraic Properties of Edge Ideals and Cover Ideals of Unbalanced Crown Graphs

inferred← citeshttps://doi.org/10.1016/0001-8708(92)90052-mopenalex-snapshot

Piercing convex sets and the Hadwiger-Debrunner (p, q)-problem

inferred← citeshttps://doi.org/10.1016/0097-3165(86)90079-8openalex-snapshot

Characterization of f-vectors of families of convex sets in Rd part II: Sufficiency of Eckhoff's conditions

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.aim.2004.03.009openalex-snapshot

A topological colorful Helly theorem

inferred← citeshttps://doi.org/10.1016/j.disc.2020.111956openalex-snapshot

Petruska’s question on planar convex sets

inferred← citeshttps://doi.org/10.1016/j.endm.2009.07.009openalex-snapshot

d-collapsibility is NP-complete for d ⩾ 4

inferred← citeshttps://doi.org/10.1016/j.jcta.2006.01.005openalex-snapshot

Intersections of Leray complexes and regularity of monomial ideals

inferred← citeshttps://doi.org/10.1016/j.jcta.2019.105204openalex-snapshot

Chordality, d-collapsibility, and componentwise linear ideals

inferred← citeshttps://doi.org/10.1016/j.jcta.2021.105430openalex-snapshot

Non-ridge-chordal complexes whose clique complex has shellable Alexander dual

inferred← citeshttps://doi.org/10.1016/s0195-6698(85)80029-9openalex-snapshot

A Simple Proof of the Upper Bound Theorem

inferred← citeshttps://doi.org/10.1016/s0196-8858(02)00003-9openalex-snapshot

Transversal numbers for hypergraphs arising in geometry

inferred← citeshttps://doi.org/10.1017/fms.2024.23openalex-snapshot

Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes

inferred← citeshttps://doi.org/10.1070/rm2008v063n06abeh004578openalex-snapshot

Topological methods in combinatorial geometry

inferred← citeshttps://doi.org/10.1080/00927872.2019.1684505openalex-snapshot

On minimal free resolution of edge ideals of multipartite crown graphs

inferred← citeshttps://doi.org/10.1080/00927872.2020.1831004openalex-snapshot

On graded Betti numbers of edge rings of deficient complete bipartite graphs

inferred← citeshttps://doi.org/10.1090/bull/1753openalex-snapshot

Helly-type problems

inferred← citeshttps://doi.org/10.1090/conm/685/13718openalex-snapshot

Helly’s theorem: New variations and applications

inferred← citeshttps://doi.org/10.1090/memo/1345openalex-snapshot

Cell complexes, poset topology and the representation theory of algebras arising in algebraic combinatorics and discrete geometry

inferred← citeshttps://doi.org/10.1090/s0002-9939-10-10463-8openalex-snapshot

Non-representability of finite projective planes by convex sets

inferred← citeshttps://doi.org/10.1090/s0273-0979-1992-00304-xopenalex-snapshot

Piercing convex sets

inferred← citeshttps://doi.org/10.1093/imrn/rnx184openalex-snapshot

Colorful Simplicial Depth, Minkowski Sums, and Generalized Gale Transforms

inferred← citeshttps://doi.org/10.1093/imrn/rnz055openalex-snapshot

Convex Union Representability and Convex Codes

inferred← citeshttps://doi.org/10.1111/j.1749-6632.1989.tb22438.xopenalex-snapshot

On f ‐Vectors and Homologya

inferred← citeshttps://doi.org/10.1112/jtopol/jtn010openalex-snapshot

Leray numbers of projections and a topological Helly-type theorem

inferred← citeshttps://doi.org/10.1112/mtk.12103openalex-snapshot

RELATIVE LERAY NUMBERS VIA SPECTRAL SEQUENCES

inferred← citeshttps://doi.org/10.1137/18m1186563openalex-snapshot

Neural Codes, Decidability, and a New Local Obstruction to Convexity

inferred← citeshttps://doi.org/10.1137/22m1481440openalex-snapshot

On Vietoris–Rips Complexes (with Scale 3) of Hypercube Graphs

inferred← citeshttps://doi.org/10.1142/s0219498825503244openalex-snapshot

Graded Betti numbers of some bipartite graphs

inferred← citeshttps://doi.org/10.1142/s0219498826501112openalex-snapshot

Certain homological invariants of some bipartite graphs

inferred← citeshttps://doi.org/10.1145/142675.142711openalex-snapshot

Piercing convex sets

inferred← citeshttps://doi.org/10.11575/cdm.v6i2.62104openalex-snapshot

Strong d-collapsibility

inferred← citeshttps://doi.org/10.1186/1687-1812-2012-11openalex-snapshot

Local properties of simplicial complexes

inferred← citeshttps://doi.org/10.1216/jca-2017-9-4-441openalex-snapshot

Powers of edge ideals of regularity three bipartite graphs

inferred← citeshttps://doi.org/10.1216/jca.2024.16.391openalex-snapshot

FRÖBERG’S THEOREM, VERTEX SPLITTABILITY AND HIGHER INDEPENDENCE COMPLEXES

inferred← citeshttps://doi.org/10.15381/pesquimat.v24i1.19717openalex-snapshot

Sobre dos Teoremas Combinatorios

inferred← citeshttps://doi.org/10.35376/10324/1769openalex-snapshot

Graded Betti numbers of edge ideals

inferred← citeshttps://doi.org/10.37236/1316openalex-snapshot

A Purely Combinatorial Proof of the Hadwiger Debrunner $(p,q)$ Conjecture

inferred← citeshttps://doi.org/10.37236/8364openalex-snapshot

Collapsibility of Simplicial Complexes of Hypergraphs

inferred← citeshttps://doi.org/10.37236/8684openalex-snapshot

Collapsibility of Non-Cover Complexes of Graphs

inferred← citeshttps://doi.org/10.37236/8844openalex-snapshot

Choice Functions in the Intersection of Matroids

inferred← citeshttps://doi.org/10.37236/9448openalex-snapshot

Cooperative Conditions for the Existence of Rainbow Matchings

inferred← citeshttps://doi.org/10.4086/cjtcs.2010.003openalex-snapshot

inferred← citeshttps://doi.org/10.4213/rm9244openalex-snapshot

Топологические методы в комбинаторной геометрии

inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.19openalex-snapshot

Optimal Bounds for the Colorful Fractional Helly Theorem

inferred← citeshttps://doi.org/10.4230/lipics.socg.2021.40openalex-snapshot

A Stepping-Up Lemma for Topological Set Systems

inferred← citeshttps://doi.org/10.46298/dmtcs.2381openalex-snapshot

Poset topology and homological invariants of algebras arising in algebraic combinatorics

inferred← citeshttps://doi.org/10.48550/arxiv.0803.3520openalex-snapshot

On the gap between representability and collapsibility

inferred← citeshttps://doi.org/10.48550/arxiv.0808.1991openalex-snapshot

d-collapsibility is NP-complete for d greater or equal to 4

inferred← citeshttps://doi.org/10.48550/arxiv.1008.1895openalex-snapshot

A counterexample to Wegner's conjecture on good covers

inferred← citeshttps://doi.org/10.48550/arxiv.1211.6254openalex-snapshot

Recognition of collapsible complexes is NP-complete

inferred← citeshttps://doi.org/10.48550/arxiv.math/9210213openalex-snapshot

Piercing convex sets

inferred← citeshttps://doi.org/10.5802/alco.119openalex-snapshot

Regularity of powers of edge ideals: from local properties to global bounds

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.