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

Abstract

For a graph G let (G) denote the number of Eulerian orientations, and v(G) denote the number of vertices of G. We show that if (Gn)n is a sequence of Eulerian graphs that are convergent in Benjamini--Schramm sense, then n ∞1v(Gn) (Gn) is convergent.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…