A short proof of the Deutsch-Sagan congruence for connected non crossing graphs
classification
🧮 math.CO
keywords
proofcongruenceconnectedgraphsshortbeenbrucecomplicated
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.