Pith. sign in

Paper Citation Record · LEDGER

Minimum degree edge-disjoint Hamilton cycles in random directed graphs

As of 22 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.

pith.paper-citation-record.v1
2502.01631 v1

Coverage vector

measured 43 of 43 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-09T14:59:29.069245Z

measured 43 of 43 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-22T06:32:14.747728+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

43 of 43 outbound references displayed

  • verified exact1
  • verified fuzzy25
  • unresolved17
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 716fd7c1-690d-495a-9f9b-7f98fd762422 · outbound

This paper cites Alon and J.H.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Alon and J.H

Reference 1

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.310282Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.645314Z digest=sha256:2c25990e6d27228dd8f7ae4c7e9e3bb7e5e23640f8dc5a35048d2b58ebeba40f

Observation 01593a7d-6717-4fd3-b18b-58afc6732535 · outbound

This paper cites Ben-Shimon, M.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ben-Shimon, M

Reference 2

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.301102Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.712754Z digest=sha256:5c354c0908d4159e6375e02d6f5b971cd289f2d0e23308c8332e60dea976b2cb

Observation d573dca5-7aad-49af-829a-c28f4c0df50e · outbound

This paper cites Bollobás,The evolution of sparse graphs, Graph theory and combinatorics (Cambridge, 1983) (1984), 35–57.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.293455Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.762495Z digest=sha256:132a19de9c37ec5d7b45cc8ae27ec1b69366c7b02d28b8fd360c6424ca356a55

Observation a2935461-c63f-4733-a314-e420815bc8cd · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 4

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:30.285245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.765921Z digest=sha256:4d6b796e163d9370ceb60b16b99e83e647ca8c41982b43b7fe7c1f4e3852f49b

Observation 44bbe4ce-bc60-4dc6-a070-ff805cdf3aed · outbound

This paper cites Bollobás and A.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Bollobás and A

Reference 5

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.277438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.776125Z digest=sha256:91e01c50baafad002a6ea100790673bcaa835d38c89bcffff49abe18ab39973f

Observation 94cbd197-6543-4bbf-8157-fd33b5d9cf2c · outbound

This paper cites Csaba, D.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Csaba, D

Reference 6

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.269285Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.779516Z digest=sha256:ace15bf26457637f62ac6a7d41e2497080e3ffb859eecff6f66ed4b5fba63edd

Observation eaf886a9-768e-4dd2-9c2b-5936247b1368 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 7

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:30.200471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.782671Z digest=sha256:868d054e3cc2f84a0dbdd36324fdf79891c6c5a3194bb5b8c33310bba53a8931

Observation fc761382-60b6-4178-9a40-42f3f9c67181 · outbound

This paper cites Ferber, M.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ferber, M

Reference 8

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.104320Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.786684Z digest=sha256:dd435517bdec7f8a74bdee2f9c6c70441d706645b5ffc818340f4eeb86a6d624

Observation a72bc06c-5ce5-4243-bb9b-7446e410551f · outbound

This paper cites Ferber, G.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ferber, G

Reference 9

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.025338Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.789632Z digest=sha256:73fda061e6c67b1e538660dfd4ade57ac301c739913602256012d94c8de54bd1

Observation 3029c955-8285-47af-b89e-f7fc908307de · outbound

This paper cites Ferber and V.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Ferber and V

Reference 10

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:30.008427Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.792292Z digest=sha256:396e5f4dc1439123cbe4f7e0a4ae565f00e977ebb8ca1d91bcf221a53a21a2a4

Observation 0a79f28f-406b-4035-a5ba-1388023f54ae · outbound

This paper cites 4, 592–603.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs 4, 592–603

Reference 11

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.999574Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.796516Z digest=sha256:3eaa2ec3b7430c344c6f5489ed0cd02ee211e9b08c3ab1eca2596293c1f7a813

Observation 044cd301-d7be-49d5-ade7-722d939fc612 · outbound

This paper cites Cycle type of random permutations: A toolkit.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Cycle type of random permutations: A toolkit

Reference 12

Resolution
verified exact
local_arxiv, observed 2026-08-09T14:59:29.109191Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.800845Z digest=sha256:7761605373f93327393d05df61c4dd08075d1587a5eeac3d43eff35bdd40bbe3

Observation 4f5c54b4-88a7-4952-abda-a342a9b27c16 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 13

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.991336Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.805068Z digest=sha256:6f2834b7011ce8b07535df8a543dd7fe9cbd41001d2475e89b78b02a706ec992

Observation 93cb775c-a8c1-4271-95f0-4dc53498c00c · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 14

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.982627Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.809125Z digest=sha256:30b8d73522071c067d51de6b2804ca1169f4d3f1f0cae6efea7c0150056f43fd

Observation e820a7c4-4d5b-4654-b97e-4f0b827272ec · outbound

This paper cites 1, 221–234.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs 1, 221–234

Reference 15

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.974220Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.812036Z digest=sha256:aabc734c7c9d35b894f4d32ad678b6f628157b99f9bb4b8521e9cfcbced43d9e

Observation 429ad014-6ecf-4bda-90b3-153d81dfe2d3 · outbound

This paper cites Ghouila-Houri,Une condition suffisante dexistence dun circuit hamiltonien, Comptes Rendus Hebdomadaires Des Seances De L’Academie Des Sciences251 (1960), no.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.941059Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.814786Z digest=sha256:81dfcb353bc065f39c82325ad2e1b42763c0b8977bb1de66d5ca447548d1e0d4

Observation b18a42ee-abd7-4477-b145-03b871e2392d · outbound

This paper cites Häggkvist,Hamilton cycles in oriented graphs, Combinatorics, Probability and Computing2 (1993), no.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.863947Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.818090Z digest=sha256:9796bc629789bbf6941e4531185456a4ae3521f4317e54f485cc719b616f963b

Observation 84bad349-32f7-474d-a9a7-86f9a34c5cac · outbound

This paper cites Janson, A.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Janson, A

Reference 18

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.854865Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.820913Z digest=sha256:27480461da1cb26a2eef420f01371b2b54f7dfb4883c38770031ebfa4f87c1f2

Observation 2814ab91-09e6-4bd5-a96a-0b24bd71675f · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 19

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.826284Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.823025Z digest=sha256:a4cc2ba43fc98ca43eec030b9a075e90347f8c143851cdc1530245be17138893

Observation 36ef0ed4-9d38-4162-9c35-d907447bd173 · outbound

This paper cites Keevash, D.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Keevash, D

Reference 20

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.703527Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.826048Z digest=sha256:0c27f450dc129abe857573eb97d83f71ff28552bae076cddefe8e7497a4ea6a0

Observation 146038f5-1706-4696-9c54-64596e7c33cf · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 21

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.691331Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.828215Z digest=sha256:60167a2e1e946444a34c909506f46d05ebea3e14c2109bf80ad98f9e85e16d15

Observation 76092a31-5133-45dc-a1f0-ed49787301ae · outbound

This paper cites 3, 397–445.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs 3, 397–445

Reference 22

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.681685Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.830396Z digest=sha256:6c8f2319b62848c9b82302050b7fcafe4e4130e211fcbf1ec47d3fd225775aac

Observation bc40dd20-1a4c-40e2-8adc-fa8da1950326 · outbound

This paper cites Komlós and E.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Komlós and E

Reference 23

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.587217Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.833096Z digest=sha256:7b7750c43abb5f16b914a80d8362c6cc959d2bc62d08efd94e6fa0289e7750b1

Observation 7e27bdf4-8fa2-4bc4-a8b8-01dafafa74d4 · outbound

This paper cites Krivelevich and W.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Krivelevich and W

Reference 24

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.570110Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.860792Z digest=sha256:7a9fa9ef89b944960fa0eac150b6cb5dfeaf243904fc01a348b552a5a1f9bd0d

Observation 8daf6b1b-2b15-4a13-9cb7-acb3cfd9d764 · outbound

This paper cites Kühn and D.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Kühn and D

Reference 25

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.561952Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.899446Z digest=sha256:de884815fb2d2e9093255dd8d74699c7dd84eac7c040c4a909f7d1dcf723ae2a

Observation cc3d2d32-7597-4574-9c75-19b297aeea7d · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 26

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.552729Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:28.974382Z digest=sha256:52c24aad8e27bc595970ab44e1a3dbf28077c9724e6e3de2e3ec666bbbb8753a

Observation 15661b11-ba84-473b-9293-6f4a9dd592f8 · outbound

This paper cites Hamilton cycles in graphs and hypergraphs: an extremal perspective.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Hamilton cycles in graphs and hypergraphs: an extremal perspective

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-09T14:59:29.022380Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-09T14:59:29.022380Z digest=sha256:e89d25ccc31a4e98be0ce9483fca594a83c836175f8fd4bb569570af0f07ae46

Observation 0ef59505-765d-4bbc-b12a-828a7ac5e014 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 28

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.543677Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.025659Z digest=sha256:9149d127d139d83f424578220a9d2153b9d478c24dc97bb61d1d0e85335361d4

Observation ab42b86e-6654-4410-b23d-aeaa3dee647b · outbound

This paper cites Lovász,Combinatorial problems and exercises, Vol.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Lovász,Combinatorial problems and exercises, Vol

Reference 29

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.534698Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.029224Z digest=sha256:d80f668bbdc5ea912ac356353dd1db47fe52507276674d2796139c1838dc2ad7

Observation 9f45b837-8b33-4fbe-a09b-6c93200b0d4c · outbound

This paper cites McDiarmid,Clutter percolation and random graphs, Combinatorial optimization ii, 1980, pp.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs McDiarmid,Clutter percolation and random graphs, Combinatorial optimization ii, 1980, pp

Reference 30

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.524652Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.032474Z digest=sha256:fa7810f182b93ee2cb3b75ef6c8be496c0194e995916f84f2aee08a7b3880430

Observation 341168cc-0098-4fa7-94f1-4723205e3d71 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 31

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.515988Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.034802Z digest=sha256:75a1ef72f49c2ebf1be596dec9f6fc4f064c172e3d8235ffb6793acf1651012d

Observation f64f20ad-618b-47a9-98f9-594c7bb045ac · outbound

This paper cites Pósa,Hamiltonian circuits in random graphs, Discrete Mathematics14 (1976), no.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Pósa,Hamiltonian circuits in random graphs, Discrete Mathematics14 (1976), no

Reference 32

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.507921Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.037835Z digest=sha256:430ef7e02acd2cb2b4be9bbb9b9a9ab4390c24c1f7008a0f7c9b58fad1c83921

Observation feafe81a-0b96-42c3-97ff-25eececc9385 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 33

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.406899Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.040394Z digest=sha256:a52647a19a08944fe66bc0551b82501f080e397a2c77c9e27b5808d5ccf49aa0

Observation e108b82c-a8bd-40b9-a6b5-979227bce673 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 34

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.329529Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.043890Z digest=sha256:3fb0b92bbd57e712f2d08669d7d8461a65ebfbeded6cefc7f5761cb61bd279ee

Observation 90315591-91df-42df-b518-4973c26a3849 · outbound

This paper cites These observations are sufficient to prove the following claim: Claim B.2.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs These observations are sufficient to prove the following claim: Claim B.2

Reference 35

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.320725Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.046860Z digest=sha256:2efe478071583a05fc0e201a156f3e17ad15f20a22690fab77d634f0ca37640d

Observation 9eb6b44c-63ca-452f-95c1-e4a1e8de8837 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 36

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.311438Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.050188Z digest=sha256:24256ac838626762abe9a972787193b42056ae751a784686ac6f0325456b6b97

Observation f4c9e0ea-0f41-4be1-ba80-c535487321c1 · outbound

This paper cites (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.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.303492Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.053037Z digest=sha256:dd913b463b23491d12c58fb4b5c06b29af7e9a7c1be0b09b0755aaa05acb98c9

Observation 7e704d7d-4e2f-44e1-9357-d04dd212f7f1 · outbound

This paper cites 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π.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.294626Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.055366Z digest=sha256:c4bd420d9f8b6f39df8b54c8507253090ac2cbe059aac8ab26c8fc905e51adb8

Observation 6152ff3b-4e23-44c7-a33a-230ce11e6961 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 39

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.285315Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.058229Z digest=sha256:43745e0f9ac781d818e3f4ac440c1785e9f564b03c29be004ab86eefa34360b8

Observation 5cfc0ab3-5010-430b-bdfb-490e531dace5 · outbound

This paper cites 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.

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

Resolution
verified fuzzy
raw_fallback, observed 2026-08-09T14:59:29.276858Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.061075Z digest=sha256:836451b82c565e59675e6637af4b27d1e6db7a5d72d3a595c699896b4c81e15b

Observation 1d1f4c6a-0179-4e20-8ae6-4e5676fb2402 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 41

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.267942Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.063382Z digest=sha256:154f8639cd75696ca44fadea033cd3923ae8d620182ab2af089a20cb816662ef

Observation 4c7d942a-1fea-4abb-a4e2-bea03eab73d7 · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 42

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.258129Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.066139Z digest=sha256:cf8acc33631f944bcbd8f5ebc24ef9461b5c7673e4eb9c5fe3e66e3cc916f965

Observation a23053be-9806-4b13-9585-f62f4cf3b61f · outbound

This paper cites an unresolved cited work.

Minimum degree edge-disjoint Hamilton cycles in random directed graphs Unresolved cited work

Reference 43

Resolution
unresolved
raw_fallback, observed 2026-08-09T14:59:29.205311Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.

source=pdf_text observed=2026-08-09T14:59:29.069245Z digest=sha256:2cdde3280a8b3357eb49c014a782174aba0173c6818191fa9f8abd204143c9f1

Pith citing papers

No inbound Pith citation observations are available.