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:4003d9bc8d337c5528eac3103915fa45ba4b76c9893054f7bb49edfbfdfd8397

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:b4a2fdfcd9efb9af3fd7a9542ff91d2194135a05f8c410fa4e37a89d9b909161

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:b15490b5207a625648fefa7099b272d126ea57569538dc9880c0a56790aac040

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:7e9838234e72a97bf5b5376d3385d84a5f341b38a8c397bdd0e39143b17cd235

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:59d1faac81bcc12f8d7d747bfae478353f18d2ebeb32775bdd84015d984ddcee

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:196de7d7f3e7e5697c22730031821ae6baf4fde2dea4a48af31a38e66857c430

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:618412044f5a9e6107531c11438b8fcd2b49e2a8d960ba3ef575b9bbd993dd7c

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:3d6b6a1f4cc7fa17a09bb411caf8989ebee1c0bd267b9b4a282a41a8b60bd2bc

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:a8720caaad2e22912bfd467e8b31c2057bd2de49f5150627dbabf05ea41cc3d9

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:ce90771a319a8d0b8efb0a18e3d911ca7d459b1333763d18dd1d6e5de09fd9a6

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:70a6d8835f23dd578093462c589665731e51e45fc72e235034af03c8980b35e6

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:38eda09014db0661edc7c500d3d67c587feb91415c49ecc0dc0172b46838094e

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:e4e99f6b4a20d5a24846146bf429b4f00971d9880a1dfd89214f5268c3ecb273

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:863c050646c88d959a8a31c30c4fc7f79881d2a51640a8faa140a6ee511386a7

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:a7518cece7da803d95c397a7bd78a77710af9546263c92d70796aa2621bc6ebb

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:7edba72fdf0c7e6657441355b7bbf4b48fae7948bad870dd94331e4b01aaf9ff

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:19ae3c935dc979fc8b3c0ef7f845c85657d4120386c824a7db39c8e8e0e4fcc7

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:2b5fb10d4a0cc9c580ce4d28096c93fb140e977dfd46d47378de6293bd9fe71f

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:434fb1e1a5113735f9976356c5efd505bf76f9746686d76c4276adbdc7cabdef

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:91d43fbc8082e1518f2b6f2c4ddc1986b967c097521e79f34c3436908ec10d3e

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:5026f86076840b7e6372d12c1d32b95ff3d986da783c2af15f926c38457cb558

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:311e784509038a7c73631289884f5d8d3738bb591d0353025fe642a2a06df018

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:821e516dff7645e6cf80f25ca694625a619c17b74eb9b17d8ed1e073241057a7

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:e2d57dc1fec040878c7977dc572d7e2d33c896511438edc7513625959f828501

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:66cdcc8552334f84c992a70b4c7b729960a62378ebd351a5239fcdb3a6847cb4

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:5db490da08e55b2c7325cf4a3330939d6dab4e4f1b67d383a1e58dcf008c43af

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:2d502883c318a49be2b4585fcd29f347347ab4ed15fa227802a043f5ad562f32

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:a61e4d1d0b565127b20344634824c502236d16fc09dbfc585f0b8d2c28c0a8f8

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:dff681b64a237dcc1c3bb60d60cdacb2fa8a7b12e7acb2bbdb8aebbfa7828046

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:744ab176c821880740f1f66ba4c2201645db200c6de910d3a2a2391860f77552

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:05762534c3e287b03c0675396a568ce50c782745a189edbe736f9ce5c4d0044f

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:d7b6b4bd8d79c04e5fddcf602d53018e1f8b5b51eaaf7844e186b17b6f742233

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:57aa0aa7a8ca7d4c3729291e433534a7b1932a3ab63d4ce340b2a524eea25b4d

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:f6340f4f3cccc17d6eb83a29b256da3fdb35b19af2f65f6a0d54a8f862f0ecbf

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:1def06ae5e198d8db731d2c1f85b4ddfd1c5f0ffa6faafe011f759c7ca42de8f

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:17e03fac67e55165bdb27c9adae6943f2e9e30e08d145b78e22e4abeeeae63d4

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:c2465842c1c542e4a8b9850903f58aaa63df5bb5d961bb63b1fa8769a82ed382

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:20a96623bfc72f9f8867f9f768531a857d019548a8723383da86930f723b59e0

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:403f3b8d1cec45d7a3e6cf53de216c88038ff0f8bcab66bcb9ec0f5721a314b5

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:41c3118f736c3fd6156f425abc2fb461ee2da54b74ae7e04240aa7c219d68fd2

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:aff44af4e43fa8c4cb6083b9781fbb3917eef478dd53780ff3ae64bd64bec87c

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:878228fe39b3a776128437a6cd21616f883b247ffb3e55f736f3ce9fce4b3368

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:2628f77ecb0ffbf9c7e7c3e5820d6dede63dcb883b6b83eebaf4da0e57dc4c05

Pith citing papers

No inbound Pith citation observations are available.