On the public citation graph
The longest path in a random graph
0 signed · 111 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.
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.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4273484openalex-extracted
Heavy and Light Paths and Hamilton Cycles
inferred← citeshttps://doi.org/10.1002/jgt.22650openalex-snapshot
Perfect matchings in random subgraphs of regular bipartite graphs
inferred← citeshttps://doi.org/10.1002/mma.3301openalex-snapshot
Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
inferred← citeshttps://doi.org/10.1002/rsa.20114openalex-snapshot
Coloring complete bipartite graphs from random lists
inferred← citeshttps://doi.org/10.1002/rsa.20215openalex-snapshot
The order of the largest complete minor in a random graph
inferred← citeshttps://doi.org/10.1002/rsa.20435openalex-snapshot
Longest cycles in sparse random digraphs
inferred← citeshttps://doi.org/10.1002/rsa.20470openalex-snapshot
The phase transition in random graphs: A simple proof
inferred← citeshttps://doi.org/10.1002/rsa.20472openalex-snapshot
Sharp threshold for the appearance of certain spanning trees in random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20508openalex-snapshot
Long paths and cycles in random subgraphs of graphs with large minimum degree
inferred← citeshttps://doi.org/10.1002/rsa.20680openalex-snapshot
Finding paths in sparse random graphs requires many queries
inferred← citeshttps://doi.org/10.1002/rsa.20749openalex-snapshot
On rigidity, orientability, and cores of random graphs with sliders
inferred← citeshttps://doi.org/10.1002/rsa.20878openalex-snapshot
Limiting shape of the depth first search tree in an Erdős‐Rényi graph
inferred← citeshttps://doi.org/10.1002/rsa.21040openalex-snapshot
Longest and shortest cycles in random planar graphs
inferred← citeshttps://doi.org/10.1002/rsa.21103openalex-snapshot
Rainbow trees in uniformly edge‐colored graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240010306openalex-snapshot
On tree census and the giant component in sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.3240020405openalex-snapshot
Cycles in a random graph near the critical point
inferred← citeshttps://doi.org/10.1007/3-540-45726-7_8openalex-snapshot
Percolation on Finite Cayley Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-55857-4_19openalex-snapshot
Tree Containment and Degree Conditions
inferred← citeshttps://doi.org/10.1007/978-3-030-83823-2_44openalex-snapshot
Loose Cores and Cycles in Random Hypergraphs
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8openalex-snapshot
An irregular mind : Szemerédi is 70
inferred← citeshttps://doi.org/10.1007/bf01303205openalex-snapshot
On depth first search strees inm-out digraphs
inferred← citeshttps://doi.org/10.1007/bf01421676openalex-snapshot
Parallel processing of graph reachability in databases
inferred← citeshttps://doi.org/10.1007/bf01788097openalex-snapshot
Induced trees in sparse random graphs
inferred← citeshttps://doi.org/10.1007/bf02122682openalex-snapshot
The chromatic number of random graphs at the double-jump threshold
inferred← citeshttps://doi.org/10.1007/bf02579230openalex-snapshot
Long paths in sparse random graphs
inferred← citeshttps://doi.org/10.1007/bf02579276openalex-snapshot
Largest random component of ak-cube
inferred← citeshttps://doi.org/10.1007/bf02579348openalex-snapshot
How many random edges make a graph hamiltonian?
inferred← citeshttps://doi.org/10.1007/bf02579445openalex-snapshot
Component structure in the evolution of random hypergraphs
inferred← citeshttps://doi.org/10.1007/bfb0029971openalex-snapshot
The giant component threshold for random regular graphs with edge faults
inferred← citeshttps://doi.org/10.1007/s00440-004-0345-zopenalex-snapshot
Linear phase transition in random linear constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s00493-007-2182-zopenalex-snapshot
Embedding nearly-spanning bounded degree trees
inferred← citeshttps://doi.org/10.1007/s00493-017-3701-1openalex-snapshot
Long Cycles in Locally Expanding Graphs, with Applications
inferred← citeshttps://doi.org/10.1007/s00493-024-00089-0openalex-snapshot
Isoperimetric Inequalities and Supercritical Percolation on High-Dimensional Graphs
inferred← citeshttps://doi.org/10.1007/s10959-017-0786-9openalex-snapshot
Exponential Extinction Time of the Contact Process on Rank-One Inhomogeneous Random Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(86)90171-8openalex-snapshot
On large matchings and cycles in sparse random graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90056-1openalex-snapshot
Trees in sparse random graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(88)90089-5openalex-snapshot
Finding hamilton cycles in sparse random graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(94)90182-1openalex-snapshot
Broadcasting in random graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00004-bopenalex-snapshot
Close-to-optimal and near-optimal broadcasting in random graphs
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50008-7openalex-snapshot
10.1016/b978-044488002-4/50008-7
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112721openalex-snapshot
Large cycles in random generalized Johnson graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114278openalex-snapshot
Linear colouring of binomial random graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103200openalex-snapshot
An analogue of the Erdős–Gallai theorem for random graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104152openalex-snapshot
Minors, connectivity, and diameter in randomly perturbed sparse graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2025.104184openalex-snapshot
Giant rainbow trees in sparse random graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.07.023openalex-snapshot
The order of the largest complete minor in a random graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106396openalex-snapshot
Heavy and light paths and Hamilton cycles
inferred← citeshttps://doi.org/10.1016/j.ipl.2023.106401openalex-snapshot
Long paths in heterogeneous random subgraphs of graphs with large minimum degree
inferred← citeshttps://doi.org/10.1016/j.jctb.2021.01.001openalex-snapshot
A scaling limit for the length of the longest cycle in a sparse random graph
inferred← citeshttps://doi.org/10.1016/j.spl.2020.108798openalex-snapshot
Last passage percolation on the complete graph
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00128-3openalex-snapshot
Random 2-SAT and unsatisfiability
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72835-4openalex-snapshot
Large Regular Factors in Random Graphs
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73627-2openalex-snapshot
Flows Through Complete Graphs
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00015-3openalex-snapshot
The giant component threshold for random regular graphs with edge faults H. Prodinger
inferred← citeshttps://doi.org/10.1017/9781108332699.003openalex-snapshot
Large-scale structures in random graphs
inferred← citeshttps://doi.org/10.1017/9781108649094.005openalex-snapshot
Expanders – how to find them, and what to find in them
inferred← citeshttps://doi.org/10.1017/cbo9781316339831openalex-snapshot
Introduction to Random Graphs
inferred← citeshttps://doi.org/10.1017/cbo9781316479988openalex-snapshot
Random Graphs, Geometry and Asymptotic Structure
inferred← citeshttps://doi.org/10.1017/cbo9781316479988.002openalex-snapshot
Long paths and Hamiltonicity in random graphs
inferred← citeshttps://doi.org/10.1017/s0963548300004302openalex-snapshot
On the Fluctuations of the Giant Component
inferred← citeshttps://doi.org/10.1017/s0963548312000533openalex-snapshot
Expanders Are Universal for the Class of All Spanning Trees
inferred← citeshttps://doi.org/10.1017/s0963548320000218openalex-snapshot
On the subgraph query problem
inferred← citeshttps://doi.org/10.1080/0020716031000079518openalex-snapshot
Random Graphs In A Neural Computation Model
inferred← citeshttps://doi.org/10.1090/s0002-9947-1988-0957061-xopenalex-snapshot
A Random Graph With a Subcritical Number of Edges
inferred← citeshttps://doi.org/10.1112/jlms.12718openalex-snapshot
Turán‐type problems for long cycles in random and pseudo‐random graphs
inferred← citeshttps://doi.org/10.1112/jlms/s2-44.2.373openalex-snapshot
Percolation in High Dimensions
inferred← citeshttps://doi.org/10.1137/090766279openalex-snapshot
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random Graph
inferred← citeshttps://doi.org/10.1137/1.9781611973099.122openalex-snapshot
Expanders Are Universal for the Class of All Spanning Trees (Extended Abstract)
inferred← citeshttps://doi.org/10.1137/100805753openalex-snapshot
Embedding Spanning Trees in Random Graphs
inferred← citeshttps://doi.org/10.1137/140969105openalex-snapshot
Acquaintance Time of Random Graphs Near Connectivity Threshold
inferred← citeshttps://doi.org/10.1137/140982842openalex-snapshot
The Approximate Loebl--Komlós--Sós Conjecture I: The Sparse Decomposition
inferred← citeshttps://doi.org/10.1137/151002496openalex-snapshot
Smoothed Analysis on Connected Graphs
inferred← citeshttps://doi.org/10.1137/20m1332992openalex-snapshot
Rainbow Hamilton Cycles in Randomly Colored Randomly Perturbed Dense Graphs
inferred← citeshttps://doi.org/10.1137/20m1345712openalex-snapshot
Longest Paths in Random Hypergraphs
inferred← citeshttps://doi.org/10.1145/113413.113438openalex-snapshot
On the expected size of recursive Datalog queries
inferred← citeshttps://doi.org/10.1214/12-aop765openalex-snapshot
Scaling window for mean-field percolation of averages
inferred← citeshttps://doi.org/10.1214/20-aihp1141openalex-snapshot
Barak-Erd\H{o}s graphs and the infinite-bin model
inferred← citeshttps://doi.org/10.1214/22-aop1592openalex-snapshot
Expansion in supercritical random subgraphs of the hypercube and its consequences
inferred← citeshttps://doi.org/10.1287/opre.2017.1644openalex-snapshot
Efficient Dynamic Barter Exchange
inferred← citeshttps://doi.org/10.1515/156939203322385856openalex-snapshot
Estimation of the time needed to set up a covert channel
inferred← citeshttps://doi.org/10.37236/10794openalex-snapshot
Loose Cores and Cycles in Random Hypergraphs
inferred← citeshttps://doi.org/10.37236/11471openalex-snapshot
A Note on Long Cycles in Sparse Random Graphs
inferred← citeshttps://doi.org/10.37236/3198openalex-snapshot
Long Paths and Cycles in Random Subgraphs of $\mathcal{H}$-Free Graphs
inferred← citeshttps://doi.org/10.37236/5392openalex-snapshot
The Phase Transition in Site Percolation on Pseudo-Random Graphs
inferred← citeshttps://doi.org/10.4213/dm191openalex-snapshot
Оценка времени, требуемого для организации скрытого канала
inferred← citeshttps://doi.org/10.48550/arxiv.1007.2326openalex-snapshot
Embedding spanning trees in random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1102.3147openalex-snapshot
Longest cycles in sparse random digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.1108.4647openalex-snapshot
Expanders Are Universal for the Class of All Spanning Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1201.6529openalex-snapshot
The phase transition in random graphs - a simple proof
inferred← citeshttps://doi.org/10.48550/arxiv.1211.3050openalex-snapshot
The approximate Loebl-Komlós-Sós Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1303.1066openalex-snapshot
Long paths and cycles in random subgraphs of H-free graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1404.5731openalex-snapshot
The phase transition in site percolation on pseudo-random graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1510.09166openalex-snapshot
Long paths and cycles in random subgraphs of graphs with large minimum degree
inferred← citeshttps://doi.org/10.48550/arxiv.1711.04059openalex-snapshot
On The Time Constant for Last Passage Percolation on Complete Graph
inferred← citeshttps://doi.org/10.48550/arxiv.1901.07139openalex-snapshot
Hamilton Cycles in Random Graphs: a bibliography
inferred← citeshttps://doi.org/10.48550/arxiv.2004.08637openalex-snapshot
Rainbow Hamilton cycles in randomly coloured randomly perturbed dense graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2101.11910openalex-snapshot
Local limit of sparse random planar graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2105.08315openalex-snapshot
Rainbow trees in uniformly edge-coloured graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2107.02061openalex-snapshot
Crux and long cycles in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.math/0512010openalex-snapshot
Colouring complete bipartite graphs from random lists
inferred← citeshttps://doi.org/10.5555/982792.982807openalex-snapshot
Linear phase transition in random linear constraint satisfaction problems
inferred← citeshttps://doi.org/10.5753/etc.2023.230768openalex-snapshot
Cobertura de grafos aleatórios por caminhos multicoloridos
inferred← citeshttps://doi.org/10.70675/4a59b2d7z7167z431dz8b60z152c930c5cceopenalex-snapshot
Matrices aléatoires et graphes aléatoires
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.