Pith. sign in

REVIEW 1 cited by

Structural characterization of Cayley graphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1609.08272 v1 pith:EYGUTVDG submitted 2016-09-27 cs.DM math.CO

Didier Caucal This is my paper · ORCID
classification cs.DMmath.CO
keywords graphscayleydeterministicsimplecyclelanguagesamevertex-transitive
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We show that the directed labelled Cayley graphs coincide with the rooted deterministic vertex-transitive simple graphs. The Cayley graphs are also the strongly connected deterministic simple graphs of which all vertices have the same cycle language, or just the same elementary cycle language. Under the assumption of the axiom of choice, we characterize the Cayley graphs for all group subsets as the deterministic, co-deterministic, vertex-transitive simple graphs.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Monotones from multi-invariants: a classification

    quant-ph 2025-09 conditional novelty 6.0 of 10

    The authors conjecture that every LOCC-monotone multi-invariant is labeled by a finite Coxeter group and prove this for the A_n, B_n, D_n and I_n families.

Pith tools