Paper Citation Record · LEDGER

Efficient Hamilton covers and linear arboricity of random graphs

As of 12 August 2026, this Paper Citation Record lists 36 of 36 outbound references and 0 inbound Pith citation observations for arXiv:2607.14881.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.14881 v1

Coverage vector

measured 36 of 36 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-02T01:16:45.721539Z

measured 36 of 36 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-12T06:34:41.77262+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

36 of 36 outbound references displayed

verified exact0
verified fuzzy0
unresolved36
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ff051f4b-abbe-4f15-8335-925d472b19cb · outbound

This paper cites The first occurrence of Hamilton cycles in random graphs.Annals of Discrete Mathematics, 27:173–178, 1985.

Efficient Hamilton covers and linear arboricity of random graphs The first occurrence of Hamilton cycles in random graphs.Annals of Discrete Mathematics, 27:173–178, 1985

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.574102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 027d1996-7944-4e96-8377-5ad7a4a7730a · outbound

This paper cites Covering and packing in graphs.

Efficient Hamilton covers and linear arboricity of random graphs Covering and packing in graphs

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.579070Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5034bb4b-156f-4f33-9b69-4d6f70838f5e · outbound

This paper cites The linear arboricity of graphs.Israel Journal of Mathematics, 62(3):311–325, 1988.

Efficient Hamilton covers and linear arboricity of random graphs The linear arboricity of graphs.Israel Journal of Mathematics, 62(3):311–325, 1988

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.583486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation be940237-893e-4e35-8c1d-e15b9903ab0f · outbound

This paper cites Algorithms with large domination ratio.

Efficient Hamilton covers and linear arboricity of random graphs Algorithms with large domination ratio

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.587699Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ddaf6309-6f1e-433d-a211-1b2549f77197 · outbound

This paper cites Spencer.The Probabilistic Method.

Efficient Hamilton covers and linear arboricity of random graphs Spencer.The Probabilistic Method

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.592239Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 23cd3a74-6cfb-4263-ac45-0f9eecf68358 · outbound

This paper cites The wonderful Walecki construction.Bulletin of the Institute of Combinatorics and its Applications, 52:7–20, 2008.

Efficient Hamilton covers and linear arboricity of random graphs The wonderful Walecki construction.Bulletin of the Institute of Combinatorics and its Applications, 52:7–20, 2008

Reference 6

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.597105Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e04ef64e-43e8-484b-b168-893592431bea · outbound

This paper cites The evolution of sparse graphs.

Efficient Hamilton covers and linear arboricity of random graphs The evolution of sparse graphs

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.601926Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d6d9faff-6c74-4dc6-90a1-4d0dca1a28c8 · outbound

This paper cites Cambridge Studies in Advanced Mathematics, volume 73.

Efficient Hamilton covers and linear arboricity of random graphs Cambridge Studies in Advanced Mathematics, volume 73

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.605763Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 62184ba0-0369-4b37-b89f-2fb323167502 · outbound

This paper cites an unresolved cited work.

Efficient Hamilton covers and linear arboricity of random graphs Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.609758Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 16fa3c5a-e44a-497d-99a9-30256c3e0111 · outbound

This paper cites New bounds for linear arboricity and related problems.

Efficient Hamilton covers and linear arboricity of random graphs New bounds for linear arboricity and related problems

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.613827Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7c06c6fa-2187-40b3-a02e-f982053960e5 · outbound

This paper cites Optimal Hamilton covers and linear arboricity for random graphs.Proceedings of the American Mathematical Society, 153(3):921–935, 2025.

Efficient Hamilton covers and linear arboricity of random graphs Optimal Hamilton covers and linear arboricity for random graphs.Proceedings of the American Mathematical Society, 153(3):921–935, 2025

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.618174Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ed3183ce-9f84-4a96-838e-a260f2a5f29e · outbound

This paper cites Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions.

Efficient Hamilton covers and linear arboricity of random graphs Hamilton cycles in pseudorandom graphs: resilience and approximate decompositions

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.622042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation eb0f2f10-6387-4158-88b2-6df33e5a08f9 · outbound

This paper cites Rolling backwards can move you forward: on embedding problems in sparse expanders.Transactions of the American Mathem- atical Society, 375(7):5195–5216, 2022.

Efficient Hamilton covers and linear arboricity of random graphs Rolling backwards can move you forward: on embedding problems in sparse expanders.Transactions of the American Mathem- atical Society, 375(7):5195–5216, 2022

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.626960Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0bd7d8d9-c00a-45b2-8836-aa4f0f4b1938 · outbound

This paper cites Hamiltonicity of expanders: optimal bounds and applications.

Efficient Hamilton covers and linear arboricity of random graphs Hamiltonicity of expanders: optimal bounds and applications

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.630918Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35c41e2b-476e-41c0-8d41-4ada354c89bd · outbound

This paper cites Towards the linear arboricity conjecture.Journal of Combinatorial Theory, Series B, 142:56–79, 2020.

Efficient Hamilton covers and linear arboricity of random graphs Towards the linear arboricity conjecture.Journal of Combinatorial Theory, Series B, 142:56–79, 2020

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.635442Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0f61c18b-1e89-4a33-abd6-4f1618654f99 · outbound

This paper cites Packing, counting and covering Hamilton cycles in random directed graphs.Israel Journal of Mathematics, 220:57–87, 2017.

Efficient Hamilton covers and linear arboricity of random graphs Packing, counting and covering Hamilton cycles in random directed graphs.Israel Journal of Mathematics, 220:57–87, 2017

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.639419Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c1f36b5-9fe6-4856-8c3c-c343fcdab0b3 · outbound

This paper cites Minimum degree edge-disjoint Hamilton cycles in random directed graphs.

Efficient Hamilton covers and linear arboricity of random graphs Minimum degree edge-disjoint Hamilton cycles in random directed graphs

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.643497Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e27898b9-b24b-4e27-b3fa-27da7d79a694 · outbound

This paper cites Expanding graphs contain all small trees.Combinatorica, 7(1):71–76, 1987.

Efficient Hamilton covers and linear arboricity of random graphs Expanding graphs contain all small trees.Combinatorica, 7(1):71–76, 1987

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.647573Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 91191a42-499a-42c9-bd12-201bf50ddbb3 · outbound

This paper cites On two Hamilton cycle problems in random graphs.Israel Journal of Mathematics, 166:221–234, 2008.

Efficient Hamilton covers and linear arboricity of random graphs On two Hamilton cycle problems in random graphs.Israel Journal of Mathematics, 166:221–234, 2008

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.651780Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 20d57376-18cf-4c88-9768-780bf8fdf5e7 · outbound

This paper cites On covering expander graphs by Hamilton cycles.Random Structures & Algorithms, 44(2):183–200, 2014.

Efficient Hamilton covers and linear arboricity of random graphs On covering expander graphs by Hamilton cycles.Random Structures & Algorithms, 44(2):183–200, 2014

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.656251Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c4ead7d9-d81b-4e21-ad3b-ed248676fe3d · outbound

This paper cites Optimal path and cycle decompositions of dense quasirandom graphs.Journal of Combinatorial Theory, Series B, 118:88–108, 2016.

Efficient Hamilton covers and linear arboricity of random graphs Optimal path and cycle decompositions of dense quasirandom graphs.Journal of Combinatorial Theory, Series B, 118:88–108, 2016

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.660477Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7364714-7a12-4205-9e00-b12a18c38a92 · outbound

This paper cites TSP tour domination and Hamilton cycle decompositions of regular digraphs.Operations Research Letters, 28:107–111, 2001.

Efficient Hamilton covers and linear arboricity of random graphs TSP tour domination and Hamilton cycle decompositions of regular digraphs.Operations Research Letters, 28:107–111, 2001

Reference 22

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.665258Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 952cf4ff-da08-444e-bb96-3b1f4d1c910a · outbound

This paper cites an unresolved cited work.

Efficient Hamilton covers and linear arboricity of random graphs Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.669401Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1057d634-9546-4470-8378-035ef3fd5688 · outbound

This paper cites Optimal covers with Hamilton cycles in random graphs.Combinatorica, 34(5):573–596, 2014.

Efficient Hamilton covers and linear arboricity of random graphs Optimal covers with Hamilton cycles in random graphs.Combinatorica, 34(5):573–596, 2014

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.673313Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f10cc416-5666-4a7c-9c0a-847a6722ed0b · outbound

This paper cites Wiley-Interscience, New York, 2000.

Efficient Hamilton covers and linear arboricity of random graphs Wiley-Interscience, New York, 2000

Reference 25

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.677367Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 22d7e213-3988-4641-bff2-b5f5cfeaa73a · outbound

This paper cites A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.Journal of the ACM, 51(4):671–697, 2004.

Efficient Hamilton covers and linear arboricity of random graphs A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.Journal of the ACM, 51(4):671–697, 2004

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.681486Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7d77ccba-b6bd-46fb-9668-83f4e975d9e6 · outbound

This paper cites Edge-disjoint Hamilton cycles in random graphs.Random Structures & Algorithms, 46(3):397–445, 2015.

Efficient Hamilton covers and linear arboricity of random graphs Edge-disjoint Hamilton cycles in random graphs.Random Structures & Algorithms, 46(3):397–445, 2015

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.685363Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ddfd68e2-3829-4c80-a204-1eb056f583af · outbound

This paper cites Limit distribution for the existence of Hamiltonian cycles in a random graph.Discrete Mathematics, 43(1):55–63, 1983.

Efficient Hamilton covers and linear arboricity of random graphs Limit distribution for the existence of Hamiltonian cycles in a random graph.Discrete Mathematics, 43(1):55–63, 1983

Reference 28

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.689564Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ab5b3223-004c-415c-9ab2-026e0f2c8c5a · outbound

This paper cites Optimal packings of Hamilton cycles in sparse random graphs.SIAM Journal on Discrete Mathematics, 26(3):964–982, 2012.

Efficient Hamilton covers and linear arboricity of random graphs Optimal packings of Hamilton cycles in sparse random graphs.SIAM Journal on Discrete Mathematics, 26(3):964–982, 2012

Reference 29

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.693722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e7c947ed-a974-4ec7-b267-4fb8c9b56e3f · outbound

This paper cites Hamilton decompositions of regular expanders: applications.

Efficient Hamilton covers and linear arboricity of random graphs Hamilton decompositions of regular expanders: applications

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.697749Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fb88e598-2c01-4657-aa7f-a27e0a40397a · outbound

This paper cites An improved bound for the linear arboricity conjecture.Com- binatorica, 43(3):547–569, 2023.

Efficient Hamilton covers and linear arboricity of random graphs An improved bound for the linear arboricity conjecture.Com- binatorica, 43(3):547–569, 2023

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.701909Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b5557405-7987-4998-a151-d049bf438702 · outbound

This paper cites Linear arboricity of random regular graphs.Random Struc- tures & Algorithms, 1(4):443–445, 1990.

Efficient Hamilton covers and linear arboricity of random graphs Linear arboricity of random regular graphs.Random Struc- tures & Algorithms, 1(4):443–445, 1990

Reference 32

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.705732Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12872807-caee-4dcc-aa6a-f7fffdb11182 · outbound

This paper cites Spanning trees in random graphs.Advances in Mathematics, 356:106793, 2019.

Efficient Hamilton covers and linear arboricity of random graphs Spanning trees in random graphs.Advances in Mathematics, 356:106793, 2019

Reference 33

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.709558Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e973efd5-83e4-4df6-9052-9adc537e021f · outbound

This paper cites Moser and G´ abor Tardos.

Efficient Hamilton covers and linear arboricity of random graphs Moser and G´ abor Tardos

Reference 34

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.713463Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fe200835-dbef-4d0f-b2bf-cc9a921526d6 · outbound

This paper cites On the circuits of finite graphs.A Magyar Tudom´ anyos Akad´ emia Matematikai Kutat´ o Int´ ezet´ enek K¨ ozlem´ enyei, 8(3):355–361, 1963.

Efficient Hamilton covers and linear arboricity of random graphs On the circuits of finite graphs.A Magyar Tudom´ anyos Akad´ emia Matematikai Kutat´ o Int´ ezet´ enek K¨ ozlem´ enyei, 8(3):355–361, 1963

Reference 35

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.717586Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ff2f9fe9-8400-4dbf-8d1d-fc7a13ef8dd4 · outbound

This paper cites Hamiltonian circuits in random graphs.Discrete Mathematics, 14(4):359–364, 1976.

Efficient Hamilton covers and linear arboricity of random graphs Hamiltonian circuits in random graphs.Discrete Mathematics, 14(4):359–364, 1976

Reference 36

Resolution: unresolved; no resolver link, observed 2026-08-02T01:16:45.721539Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.