On the public citation graph

Heavy and Light Paths and Hamilton Cycles

https://doi.org/10.2139/ssrn.4273484
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.1002/rsa.20342openalex-extracted
Anatomy of a young giant component in the random graph
inferredcites →https://doi.org/10.1002/rsa.20470openalex-extracted
The phase transition in random graphs: A simple proof
inferredcites →https://doi.org/10.1002/rsa.3240010305openalex-extracted
Component behavior near the critical point of the random graph process
inferredcites →https://doi.org/10.1002/rsa.3240030202openalex-extracted
Almost all cubic graphs are Hamiltonian
inferredcites →https://doi.org/10.1006/jagm.1996.0042openalex-extracted
Generating and Counting Hamilton Cycles in Random Regular Graphs
inferredcites →https://doi.org/10.1007/978-1-4757-6594-6openalex-extracted
Stochastic Optimization: Algorithms and Applications
inferredcites →https://doi.org/10.1007/bf02579172openalex-extracted
The longest path in a random graph
inferredcites →https://doi.org/10.1007/pl00009825openalex-extracted
Random Minimum Length Spanning Trees in Regular Graphs
inferredcites →https://doi.org/10.1016/j.ejc.2013.06.004openalex-extracted
Anatomy of the giant component: The strictly supercritical regime
inferredcites →https://doi.org/10.1017/cbo9781316339831openalex-extracted
Introduction to Random Graphs
inferredcites →https://doi.org/10.1137/090766279openalex-extracted
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph
inferredcites →https://doi.org/10.1214/aos/1176349952openalex-extracted
An Efron-Stein Inequality for Nonsymmetric Statistics
inferredcites →https://doi.org/10.48550/arxiv.0907.3511openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2208.06851openalex-extracted
An improved lower bound on the length of the longest cycle in random 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.