Pith. sign in

Paper Citation Record · LEDGER

Minimum degree edge-disjoint Hamilton cycles in random directed graphs

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.

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-13T06:32:02.005865+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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.762495Z digest=sha256:95ff68b680e253ef23b34aebe102c10d89854f5e1f902bc9609627e196f3b0fb

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.776125Z digest=sha256:1cf4f664392276af42e7efda2df273b79f97342a1ed522821a8ca036809b10a4

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.789632Z digest=sha256:916efc90d13e4359c660e12c6bdda97de5a4e7f8240bee76fee7e5b126b70a7b

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.792292Z digest=sha256:7450b04b49bca46908898a6266cfd4b292907c9b9ea3fe9b834988106948bc4b

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.800845Z digest=sha256:14d61c8e9a560f373bd552cae2845186943f1c87d435529f5ae53780bc36e260

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.805068Z digest=sha256:9903785be92c6c95fd521d763cc62639458f1ca0e963a2d1e250d5be63958f7f

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.809125Z digest=sha256:1f26f186278a75286ebaf9267d93fe2cf87dc2ab04cc43f5c4129b73514b9d06

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.818090Z digest=sha256:53b51b222752757965d64690d5543531ccd8e7e425f8fdab1bfc0ea8b2e0f61b

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.820913Z digest=sha256:9340fb3fbc52d93e53f0210fd9e6efaf4fabc5f2825e2d887e3b2c64914be429

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.826048Z digest=sha256:6feda54e170daa843b5c4728dfadb038e8d6c2e1c73950f957005da7198359c5

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.860792Z digest=sha256:48df0f1d10753b42fd8c80a4438293b57a7df5afd8f4cadbdedd5856417d4751

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:28.974382Z digest=sha256:9ed1d9aa250e0e3c056276d4a04f5bf50e6f91e2f7f0a588ec65a83d94624d7c

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:136be97ec43247406bdf37f7dc77832b3efa3b3c0fc886f397cf3e34527d82f5

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:29.037835Z digest=sha256:2afaf4cc33118157bd80c8f2bdbe6e3d69ac7e87fed4a1640ae413839dac1a75

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:29.043890Z digest=sha256:2804004cc2ca71557101012d43676a771eb4adadb28ba3e5bd2e2087aff90dbd

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

source=pdf_text observed=2026-08-09T14:59:29.061075Z digest=sha256:423230af1d2a4cb29e67d961de96b15cb5ae94b1b97383688e6e75e6359ebdd9

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

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-13T06:32:02.005865+00:00.

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

Pith citing papers

No inbound Pith citation observations are available.