Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-09T14:59:29.069245Z
Paper Citation Record · LEDGER
As of 13 August 2026, this Paper Citation Record lists 43 of 43 outbound references and 0 inbound Pith citation observations for arXiv:2502.01631.
A citation records a reference. It does not transfer a finding from one paper to another.
Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-09T14:59:29.069245Z
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-13T06:32:02.005865+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
43 of 43 outbound references displayed
External citation measurements
No source-named external measurement is stored.
Observation 716fd7c1-690d-495a-9f9b-7f98fd762422 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Alon and J.H
Reference 1
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 01593a7d-6717-4fd3-b18b-58afc6732535 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ben-Shimon, M
Reference 2
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation d573dca5-7aad-49af-829a-c28f4c0df50e · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Bollobás,The evolution of sparse graphs, Graph theory and combinatorics (Cambridge, 1983) (1984), 35–57
Reference 3
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation a2935461-c63f-4733-a314-e420815bc8cd · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 4
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 44bbe4ce-bc60-4dc6-a070-ff805cdf3aed · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Bollobás and A
Reference 5
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 94cbd197-6543-4bbf-8157-fd33b5d9cf2c · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Csaba, D
Reference 6
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation eaf886a9-768e-4dd2-9c2b-5936247b1368 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 7
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation fc761382-60b6-4178-9a40-42f3f9c67181 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ferber, M
Reference 8
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation a72bc06c-5ce5-4243-bb9b-7446e410551f · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ferber, G
Reference 9
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 3029c955-8285-47af-b89e-f7fc908307de · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ferber and V
Reference 10
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 0a79f28f-406b-4035-a5ba-1388023f54ae · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs 4, 592–603
Reference 11
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 044cd301-d7be-49d5-ade7-722d939fc612 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Cycle type of random permutations: A toolkit
Reference 12
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 4f5c54b4-88a7-4952-abda-a342a9b27c16 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 13
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 93cb775c-a8c1-4271-95f0-4dc53498c00c · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 14
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation e820a7c4-4d5b-4654-b97e-4f0b827272ec · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs 1, 221–234
Reference 15
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 429ad014-6ecf-4bda-90b3-153d81dfe2d3 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ghouila-Houri,Une condition suffisante dexistence dun circuit hamiltonien, Comptes Rendus Hebdomadaires Des Seances De L’Academie Des Sciences251 (1960), no
Reference 16
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation b18a42ee-abd7-4477-b145-03b871e2392d · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Häggkvist,Hamilton cycles in oriented graphs, Combinatorics, Probability and Computing2 (1993), no
Reference 17
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 84bad349-32f7-474d-a9a7-86f9a34c5cac · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Janson, A
Reference 18
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 2814ab91-09e6-4bd5-a96a-0b24bd71675f · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 19
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 36ef0ed4-9d38-4162-9c35-d907447bd173 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Keevash, D
Reference 20
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 146038f5-1706-4696-9c54-64596e7c33cf · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 21
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 76092a31-5133-45dc-a1f0-ed49787301ae · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs 3, 397–445
Reference 22
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation bc40dd20-1a4c-40e2-8adc-fa8da1950326 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Komlós and E
Reference 23
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 7e27bdf4-8fa2-4bc4-a8b8-01dafafa74d4 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Krivelevich and W
Reference 24
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 8daf6b1b-2b15-4a13-9cb7-acb3cfd9d764 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Kühn and D
Reference 25
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation cc3d2d32-7597-4574-9c75-19b297aeea7d · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 26
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 15661b11-ba84-473b-9293-6f4a9dd592f8 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Hamilton cycles in graphs and hypergraphs: an extremal perspective
Reference 27
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0ef59505-765d-4bbc-b12a-828a7ac5e014 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 28
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation ab42b86e-6654-4410-b23d-aeaa3dee647b · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Lovász,Combinatorial problems and exercises, Vol
Reference 29
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 9f45b837-8b33-4fbe-a09b-6c93200b0d4c · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs McDiarmid,Clutter percolation and random graphs, Combinatorial optimization ii, 1980, pp
Reference 30
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 341168cc-0098-4fa7-94f1-4723205e3d71 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 31
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation f64f20ad-618b-47a9-98f9-594c7bb045ac · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Pósa,Hamiltonian circuits in random graphs, Discrete Mathematics14 (1976), no
Reference 32
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation feafe81a-0b96-42c3-97ff-25eececc9385 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 33
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation e108b82c-a8bd-40b9-a6b5-979227bce673 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 34
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 90315591-91df-42df-b518-4973c26a3849 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs These observations are sufficient to prove the following claim: Claim B.2
Reference 35
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 9eb6b44c-63ca-452f-95c1-e4a1e8de8837 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 36
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation f4c9e0ea-0f41-4be1-ba80-c535487321c1 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs (ii) While P is not a directed cycle, do the following step: Note that the componentP is either a directed path or an isolated vertex
Reference 37
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 7e704d7d-4e2f-44e1-9357-d04dd212f7f1 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs This procedure incrementally reveals the permutationπ by following the edges of the matchings M1, M2, and M3 that define the cyclesC1, C2, and C3, repectively, inDπ
Reference 38
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 6152ff3b-4e23-44c7-a33a-230ce11e6961 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 39
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 5cfc0ab3-5010-430b-bdfb-490e531dace5 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Note that ifz is the other endpoint of the path, and we considerz ∈ X, then in order to close the cycle, its unique neighbor inMs, if yet unlabeled, must be labeledw
Reference 40
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 1d1f4c6a-0179-4e20-8ae6-4e5676fb2402 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 41
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation 4c7d942a-1fea-4abb-a4e2-bea03eab73d7 · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 42
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
Observation a23053be-9806-4b13-9585-f62f4cf3b61f · outbound
Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work
Reference 43
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.
No inbound Pith citation observations are available.