On the public citation graph

Hyperconnectivity of graphs

https://doi.org/10.1007/bf02582930
0 signed · 71 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/bf01350130openalex-snapshot
Existenz gewisser Konfigurationen inn-ges�ttigten Graphen und in Graphen gen�gend gro�er Kantendichte
inferredcites →https://doi.org/10.1007/bf01534980openalex-snapshot
On graphs and rigidity of plane skeletal structures
inferredcites →https://doi.org/10.1007/bf02761162openalex-snapshot
Intersection patterns of convex sets
inferredcites →https://doi.org/10.1007/bf02761163openalex-snapshot
Characterization off-vectors of families of convex sets inR d Part I: Necessity of Eckhoff’s conditions
inferredcites →https://doi.org/10.1007/bf02804017openalex-snapshot
Enumeration ofQ-acyclic simplicial complexes
inferredcites →https://doi.org/10.1016/0001-8708(76)90104-3openalex-snapshot
Finite-dimensional multilinear algebra
inferredcites →https://doi.org/10.1016/0012-365x(89)90315-4openalex-snapshot
Combinatorial geometries
inferredcites →https://doi.org/10.1016/s0195-6698(82)80025-5openalex-snapshot
An Extremal Problem for two Families of Sets
inferredcites →https://doi.org/10.1016/s0304-0208(08)72824-xopenalex-snapshot
Weakly Saturated Graphs are Rigid
inferredcites →https://doi.org/10.1017/cbo9780511662133.005openalex-snapshot
Connectivity and edge-connectivity in finite graphs
inferredcites →https://doi.org/10.1090/cbms/062/08openalex-snapshot
Weakly Saturated Graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1978-0511410-9openalex-snapshot
The Rigidity of Graphs
inferredcites →https://doi.org/10.1145/321592.321599openalex-snapshot
The Use of Information in Sorting
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.2307/2311408openalex-snapshot
A Problem in Graph Theory

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.23211openalex-snapshot
Weak Rainbow Saturation Numbers of Graphs
inferred← citeshttps://doi.org/10.1002/jgt.70004openalex-snapshot
Weak Saturation Numbers in Random Graphs
inferred← citeshttps://doi.org/10.1002/rsa.20703openalex-snapshot
Saturation in random graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-87363-3_21openalex-snapshot
Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes
inferred← citeshttps://doi.org/10.1007/978-3-319-20155-9_20openalex-snapshot
Bipartite Rigidity
inferred← citeshttps://doi.org/10.1007/bf01405094openalex-snapshot
Rigidity and the lower bound theorem 1
inferred← citeshttps://doi.org/10.1007/bf02582934openalex-snapshot
A new approach to Turán's conjecture
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/s00454-006-1248-1openalex-snapshot
Rigidity and the Lower Bound Theorem for Doubly Cohen-Macaulay Complexes
inferred← citeshttps://doi.org/10.1007/s00454-007-9017-yopenalex-snapshot
Rigidity and the Lower Bound Theorem for Doubly Cohen–Macaulay Complexes
inferred← citeshttps://doi.org/10.1007/s00454-024-00698-yopenalex-snapshot
Realizations of Multiassociahedra via Rigidity
inferred← citeshttps://doi.org/10.1007/s00493-023-00049-0openalex-snapshot
Weak Saturation of Multipartite Hypergraphs
inferred← citeshttps://doi.org/10.1007/s00493-025-00174-yopenalex-snapshot
Weak saturation rank: a failure of the linear algebraic approach to weak saturation
inferred← citeshttps://doi.org/10.1007/s00493-026-00208-zopenalex-snapshot
Rigidity Matroids and Linear Algebraic Matroids with Applications to Matrix Completion and Tensor Codes
inferred← citeshttps://doi.org/10.1007/s10801-005-4626-0openalex-snapshot
Algebraic Shifting and Basic Constructions on Simplicial Complexes
inferred← citeshttps://doi.org/10.1007/s10801-009-0189-9openalex-snapshot
Lefschetz properties and basic constructions on simplicial spheres
inferred← citeshttps://doi.org/10.1007/s41980-023-00829-wopenalex-snapshot
Inclusion Matrices for Rainbow Subsets
inferred← citeshttps://doi.org/10.1016/0095-8956(90)90096-iopenalex-snapshot
Symmetric matroids
inferred← citeshttps://doi.org/10.1016/0097-3165(85)90048-2openalex-snapshot
An extremal problem for sets with applications to graph theory
inferred← citeshttps://doi.org/10.1016/j.amc.2023.128097openalex-snapshot
Weak saturation number of a complete bipartite graph
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.018openalex-snapshot
Algebraic shifting of cyclic polytopes and stacked polytopes
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111886openalex-snapshot
Set systems related to a house allocation problem
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114078openalex-snapshot
The weak saturation number of K2,t
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103777openalex-snapshot
Weak saturation stability
inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103783openalex-snapshot
Long running times for hypergraph bootstrap percolation
inferred← citeshttps://doi.org/10.1016/j.endm.2017.07.049openalex-snapshot
Extremal Bounds for Bootstrap Percolation in the Hypercube
inferred← citeshttps://doi.org/10.1016/j.jcta.2017.11.018openalex-snapshot
Extremal bounds for bootstrap percolation in the hypercube
inferred← citeshttps://doi.org/10.1016/j.jcta.2020.105357openalex-snapshot
Weak saturation numbers of complete bipartite graphs in the clique
inferred← citeshttps://doi.org/10.1016/j.jctb.2023.10.012openalex-snapshot
Maximal matroids in weak order posets
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.09.002openalex-snapshot
Volume rigidity and algebraic shifting
inferred← citeshttps://doi.org/10.1016/j.jctb.2024.12.007openalex-snapshot
Weak saturation in graphs: A combinatorial approach
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.01.003openalex-snapshot
Rigidity and reconstruction in matroids of highly connected graphs
inferred← citeshttps://doi.org/10.1017/cbo9781139004114.004openalex-snapshot
Hypergraph Turán problems
inferred← citeshttps://doi.org/10.1017/s0963548301004746openalex-snapshot
Weakly Saturated Hypergraphs and Exterior Algebra
inferred← citeshttps://doi.org/10.1017/s0963548316000122openalex-snapshot
Saturation in the Hypercube and Bootstrap Percolation
inferred← citeshttps://doi.org/10.1017/s0963548325100187openalex-snapshot
A note on the computational complexity of weak saturation
inferred← citeshttps://doi.org/10.1017/s0963548325100229openalex-snapshot
Saturation in random hypergraphs
inferred← citeshttps://doi.org/10.1080/00927870701405082openalex-snapshot
Algebraic Shifting of Finite Graphs
inferred← citeshttps://doi.org/10.1090/conm/178/01903openalex-snapshot
Abstract rigidity in 𝑚-space
inferred← citeshttps://doi.org/10.1090/proc/16197openalex-snapshot
Weakly saturated hypergraphs and a conjecture of Tuza
inferred← citeshttps://doi.org/10.1090/tran/6512openalex-snapshot
Bipartite rigidity
inferred← citeshttps://doi.org/10.1112/jlms.12484openalex-snapshot
Combinatorics in the exterior algebra and the Bollob\'{a}s Two Families Theorem.
inferred← citeshttps://doi.org/10.1134/s1064562423700448openalex-snapshot
Weakly Saturated Subgraphs of Random Graphs
inferred← citeshttps://doi.org/10.1137/0404032openalex-snapshot
Rigidity Matroids
inferred← citeshttps://doi.org/10.1137/22m1527507openalex-snapshot
Multitriangulations and Tropical Pfaffians
inferred← citeshttps://doi.org/10.1214/21-ejp650openalex-snapshot
A sharp threshold for bootstrap percolation in a random hypergraph
inferred← citeshttps://doi.org/10.2969/aspm/03310121openalex-snapshot
Algebraic Shifting
inferred← citeshttps://doi.org/10.31857/s268695432370008xopenalex-snapshot
WEAKLY SSATURATED SUBGRAPHS OF RANDOM GRAPHS
inferred← citeshttps://doi.org/10.37236/11307openalex-snapshot
On the Running Time of Hypergraph Bootstrap Percolation
inferred← citeshttps://doi.org/10.37236/41openalex-snapshot
A Survey of Minimum Saturated Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2006.06855openalex-snapshot
Threshold for weak saturation stability
inferred← citeshttps://doi.org/10.48550/arxiv.math/0411009openalex-snapshot
Embeddability and Stresses of Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0610190openalex-snapshot
Monomial ideals arising from flag complexes whose generic initial ideals do not depend on term orders
inferred← citeshttps://doi.org/10.5070/c63160428openalex-snapshot
Bar-and-joint rigidity on the moment curve coincides with cofactor rigidity on a conic
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-034openalex-snapshot
Strict Erdős-Ko-Rado for simplicial complexes
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.