Pith. sign in

REVIEW

Number of Eulerian orientations for Benjamini--Schramm convergent graph sequences

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 2409.18012 v1 pith:PLJDQE22 submitted 2024-09-26 math.CO

Ferenc Bencs , Márton Borbényi , Péter Csikvári This is my paper
classification math.CO
keywords convergenteuleriannumberbenjamini--schrammdenotegraphorientationsvarepsilon
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

For a graph $G$ let $\varepsilon(G)$ denote the number of Eulerian orientations, and $v(G)$ denote the number of vertices of $G$. We show that if $(G_n)_n$ is a sequence of Eulerian graphs that are convergent in Benjamini--Schramm sense, then $\lim\limits_{n\to \infty}\frac{1}{v(G_n)}\ln \varepsilon(G_n)$ is convergent.

Discussion (0). Sign in to comment.

Pith tools