A short proof of the Deutsch-Sagan congruence for connected non crossing graphs
Abstract
We give a short proof, using Lagrange inversion, of a congruence modulo 3 for the number of connected noncrossing graphs on n vertices that was conjectured by Emeric Deutsch and Bruce Sagan. A more complicated proof had been given earlier by S.-P. Eu, S.-C. Liu, and Y.-N. Yeh.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.