REVIEW 2 cited by
Longer cycles in vertex transitive graphs
Not yet reviewed by Pith; the record is open.
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
Longer cycles in vertex transitive graphs
read the original abstract
In 1979 Babai found a clever argument to prove that every connected vertex transitive graph on $n \ge 3$ vertices contains a cycle of length at least $\sqrt{3n}$. Here we modify his approach to show that such graphs must contain a cycle of length at least $(1 - o(1))n^{3/5}$.
Forward citations
Cited by 2 Pith papers
-
Long Directed Cycles in Vertex-Transitive Digraphs
Connected vertex-transitive digraphs on n vertices can have perimeter gap ≥ n/12, and every such digraph contains a directed cycle of length Ω(√n).
-
Towards the Lov\'{a}sz conjecture via sublinear expanders
Every connected vertex-transitive graph of order n contains a cycle of length at least n^{2/3-o(1)}.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.