On the public citation graph

Hitting time fork edge-disjoint spanning trees in a random graph

https://doi.org/10.1007/bf01882200
0 signed · 19 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.1002/jgt.3190030110openalex-snapshot
A Note on Sub‐Eulerian Graphs
inferredcites →https://doi.org/10.1002/jgt.3190120105openalex-snapshot
A reduction method to find spanning Eulerian subgraphs
inferredcites →https://doi.org/10.1007/bf01946380openalex-snapshot
Edge disjoint spanning trees in random graphs
inferredcites →https://doi.org/10.1007/bf02579321openalex-snapshot
An algorithm for finding hamilton paths and cycles in random graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73611-9openalex-snapshot
On Matchings and Hamiltonian Cycles in Random Graphs
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.221openalex-snapshot
On the Problem of Decomposing a Graph into n Connected Factors
inferredcites →https://doi.org/10.1112/jlms/s1-36.1.445openalex-snapshot
Edge-Disjoint Spanning Trees of Finite Graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20059openalex-snapshot
Positional games on random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20392openalex-snapshot
Hitting time results for Maker‐Breaker games
inferred← citeshttps://doi.org/10.1002/rsa.20743openalex-snapshot
Arboricity and spanning‐tree packing in random graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-33828-6_9openalex-snapshot
Generalized Connectivity for Random Graphs
inferred← citeshttps://doi.org/10.1007/s10801-011-0297-1openalex-snapshot
Connected components and evolution of random graphs: an algebraic approach
inferred← citeshttps://doi.org/10.1016/j.procs.2021.11.046openalex-snapshot
Hitting times for arc-disjoint arborescences in random digraph processes
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1137/1.9781611973402.23openalex-snapshot
Arboricity and spanning-tree packing in random graphs with an application to load balancing
inferred← citeshttps://doi.org/10.48550/arxiv.1207.1838openalex-snapshot
A survey on the generalized connectivity of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1097openalex-snapshot
Note on packing of edge-disjoint spanning trees in sparse random graphs
inferred← citeshttps://doi.org/10.5555/2133036.2133106openalex-snapshot
Hitting time results for Maker-Breaker games: extended abstract
inferred← citeshttps://doi.org/10.5555/2634074.2634097openalex-snapshot
Arboricity and spanning-tree packing in random graphs with an application to load balancing
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.