On the public citation graph

Degree sequences of connected hypergraphs and hypertrees

https://doi.org/10.1007/bfb0073123
0 signed · 14 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.1016/0012-365x(75)90082-5openalex-snapshot
Cayley's formula for multidimensional trees
inferredcites →https://doi.org/10.1016/s0924-6509(09)x7013-3openalex-snapshot
Graphs and Hypergraphs
inferredcites →https://doi.org/10.1090/s0002-9939-1975-0384610-1openalex-snapshot
Degree Sequences in Complexes and Hypergraphs

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-319-94776-1_33openalex-snapshot
An Efficiently Recognisable Subset of Hypergraphic Sequences
inferred← citeshttps://doi.org/10.1007/bf01070234openalex-snapshot
Graphs and degree sequences. I
inferred← citeshttps://doi.org/10.1007/bf01082602openalex-snapshot
Graphs and degree sequences. II
inferred← citeshttps://doi.org/10.1007/bf02032163openalex-snapshot
Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
inferred← citeshttps://doi.org/10.1016/j.disc.2013.03.003openalex-snapshot
Realizing degree sequences with k -edge-connected uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112192openalex-snapshot
The average number of spanning hypertrees in sparse uniform hypergraphs
inferred← citeshttps://doi.org/10.1016/s0924-6509(08)70105-3openalex-snapshot
WITHDRAWN: References
inferred← citeshttps://doi.org/10.1017/s0963548321000158openalex-snapshot
Spanning trees in random regular uniform hypergraphs
inferred← citeshttps://doi.org/10.33915/etd.4970openalex-snapshot
Connectivity and spanning trees of graphs
inferred← citeshttps://doi.org/10.33915/etd.5717openalex-snapshot
Connectivity and spanning trees of graphs
inferred← citeshttps://doi.org/10.70675/abb32cdez068cz4386z8abfza78667231c8aopenalex-snapshot
Estimation of high dimensional probability density functions with low rank-tensors models : application to flow cytometry
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.