Paper Citation Record · LEDGER

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument

As of 11 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2501.13907.

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

pith.paper-citation-record.v1
2501.13907 v1

Coverage vector

measured 28 of 28 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-10T15:45:26.721080Z

measured 29 of 29 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-10T15:06:19.098832Z

measured 0 of 1 external citation measurements

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

Source: pith, observed 2026-08-10T15:06:19.390722Z

Reference resolution

28 of 28 outbound references displayed

verified exact9
verified fuzzy5
unresolved12
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation c92c84be-f9e5-4ccc-b0ad-f3a32f7a67d5 · outbound

This paper cites Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Polynomial-time algorithm for maximum independent set in bounded-degree graphs with no long induced claws

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:45:27.405005Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 1459b387-d48d-40e3-8740-1915fb6a5d19 · outbound

This paper cites Graphs with polynomially many minimal separators.J.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Graphs with polynomially many minimal separators.J

Reference 2

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.932991Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 31d7669f-b7d5-420d-8b47-45f0d98eb021 · outbound

This paper cites Max weight in- dependent set in sparse graphs with no long claws.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Max weight in- dependent set in sparse graphs with no long claws

Reference 3

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.919334Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2d73f80a-1247-4da0-bb5d-f2c12bb1f99c · outbound

This paper cites Sey- mour.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Sey- mour

Reference 4

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.905188Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation efc86cac-e431-4f15-a4fd-76ab31f71438 · outbound

This paper cites Alekseev.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Alekseev

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:45:27.388410Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 8a96ae87-5ecf-4103-9903-be3ed300dcff · outbound

This paper cites Alekseev.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Alekseev

Reference 6

Resolution: malformed identifier; raw_fallback, observed 2026-08-10T15:45:27.372949Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2b53149f-7979-483c-8ec4-72be614c79d8 · outbound

This paper cites Alekseev.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Alekseev

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:45:27.357537Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation c741155d-b1f0-4450-a0b8-bd500cc7ce19 · outbound

This paper cites Subexponential-time algorithms for Maximum Independent Set inPt-free and broom-free graphs.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Subexponential-time algorithms for Maximum Independent Set inPt-free and broom-free graphs

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.635966Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e0cb4f33-cf83-41d7-85fd-112a4d19836e · outbound

This paper cites Tree independence number V.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Tree independence number V

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:45:27.343734Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 6ebec9a6-c02a-4122-85e5-9c6b4f4b5486 · outbound

This paper cites Quasi- polynomial time approximation schemes for the Maximum Weight Independent Set Prob- lem in H-free graphs.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Quasi- polynomial time approximation schemes for the Maximum Weight Independent Set Prob- lem in H-free graphs

Reference 10

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.882428Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation b3177e89-b021-47bc-833f-d5d79626696f · outbound

This paper cites an unresolved cited work.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Unresolved cited work

Reference 11

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.867603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation e2236f8d-c542-446e-9b15-aef7751eab0c · outbound

This paper cites an unresolved cited work.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Unresolved cited work

Reference 12

Resolution: unresolved; raw_fallback, observed 2026-08-10T15:45:27.329713Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation bb720b94-6b1f-4745-9f3f-f9f0a65f0de3 · outbound

This paper cites Independent set onPk-free graphs in quasi-polynomial time.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Independent set onPk-free graphs in quasi-polynomial time

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.663366Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d1304be7-8b5c-4868-ba32-3b5d232b1b6a · outbound

This paper cites Maximum weight independent set in graphs with no long claws in quasi- polynomial time.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Maximum weight independent set in graphs with no long claws in quasi- polynomial time

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.667421Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c91e9345-1a22-46ce-8fd2-a9b7e46127b7 · outbound

This paper cites Finding large induced sparse subgraphs inC>t-free graphs in quasipolynomial time.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Finding large induced sparse subgraphs inC>t-free graphs in quasipolynomial time

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.671846Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 65312344-365e-4fbb-8968-1f54f9097207 · outbound

This paper cites Polynomial-time algorithm for Maximum Weight Independent Set onP6-free graphs.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Polynomial-time algorithm for Maximum Weight Independent Set onP6-free graphs

Reference 16

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.844542Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2eadb257-8c57-4034-9e7c-83933763cc7c · outbound

This paper cites On Ramsey covering-numbers.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument On Ramsey covering-numbers

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-10T15:45:27.315742Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 2c7bff06-04c1-434a-89f8-8b525394437e · outbound

This paper cites Problems from the world surrounding perfect graphs.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Problems from the world surrounding perfect graphs

Reference 18

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.685080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4cd50170-7400-4100-a9f5-3930bc890dd9 · outbound

This paper cites Clique is hard to approximate withinn1−ε.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Clique is hard to approximate withinn1−ε

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.689431Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4a066f7e-e55d-44cd-a3f8-534a3dd1a12a · outbound

This paper cites Three-in-a-tree in near linear time.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Three-in-a-tree in near linear time

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.694627Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5aef2744-47e0-46aa-8966-693a011afa21 · outbound

This paper cites Independent set inP5-free graphs in polynomial time.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Independent set inP5-free graphs in polynomial time

Reference 21

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.698858Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 73f5142e-4f48-4dce-8dee-cda0222f2793 · outbound

This paper cites Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument.The ACM Transactions on Compu- tation Theory, 16(2), mar 2024.doi:10.1145/3636422.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás’ Path Argument.The ACM Transactions on Compu- tation Theory, 16(2), mar 2024.doi:10.1145/3636422

Reference 22

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.801234Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation 26081db5-623e-49ee-9b0b-d1ad3ace3b2a · outbound

This paper cites an unresolved cited work.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Unresolved cited work

Reference 23

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.707444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e6c40522-279e-44c7-b881-86310bebadeb · outbound

This paper cites Quasi-polynomial-time algo- rithm for independent set in Pt-free graphs via shrinking the space of induced paths.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Quasi-polynomial-time algo- rithm for independent set in Pt-free graphs via shrinking the space of induced paths

Reference 24

Resolution: malformed identifier; no resolver link, observed 2026-08-10T15:45:26.711840Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15afdbf1-02fd-453e-bd3c-242da5e988aa · outbound

This paper cites Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Algorithme de recherche d’un stable de cardinalite maximum dans un graphe sans etoile

Reference 25

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.767582Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation ab4990e2-a2ea-4ea8-8253-52b6363953fe · outbound

This paper cites Linear degree extractors and the inapproximability of Max Clique and Chro- matic Number.Theory of Computing, 3(1):103–128, 2007.doi:10.4086/toc.2007.v003a006.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Linear degree extractors and the inapproximability of Max Clique and Chro- matic Number.Theory of Computing, 3(1):103–128, 2007.doi:10.4086/toc.2007.v003a006

Reference 26

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.721080Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 83c6c730-050e-4d35-b741-63f89e71cd24 · outbound

This paper cites doi:10.1137/1.9781611977073.61.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument doi:10.1137/1.9781611977073.61

Reference 1470

Resolution: verified exact; doi, observed 2026-08-10T15:45:26.947142Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

Observation cb71fd1d-80ec-4b12-97ff-7774590140d3 · outbound

This paper cites an unresolved cited work.

Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument Unresolved cited work

Reference 2010

Resolution: unresolved; no resolver link, observed 2026-08-10T15:45:26.658666Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation e4c63799-3ed2-4720-87f2-8097f9d241f4 · inbound

Tree independence number V. Walls and claws cites this paper.

Tree independence number V. Walls and claws Graphs with no long claws: An improved bound for the analog of the Gy\'{a}rf\'{a}s' path argument

Reference 4

Resolution: verified exact; local_arxiv, observed 2026-08-10T15:06:19.395744Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.