Terrain-like Graphs and the Median Genocchi Numbers

10/28/2022
by   Vincent Froese, et al.
0

A graph with vertex set {1,…,n} is terrain-like if, for any edge pair {a,c},{b,d} with a<b<c<d, the edge {a,d} also exists. Terrain-like graphs frequently appear in geometry in the context of visibility graphs. We show that terrain-like graphs are counted by the median Genocchi numbers. To this end, we prove a bijection between terrain-like graphs and Dumont derangements of the second kind.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset
Success!
Error Icon An error occurred

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro