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

page 1

page 2

page 3

page 4

research
04/13/2023

On a generalization of median graphs: k-median graphs

Median graphs are connected graphs in which for all three vertices there...
research
01/17/2020

On Visibility Graphs of Convex Fans and Terrains

For two points in the closure of a simple polygon P, we say that they se...
research
10/18/2021

Planar Median Graphs and Cubesquare-Graphs

Median graphs are connected graphs in which for all three vertices there...
research
10/18/2020

Colourings of (m, n)-coloured mixed graphs

A mixed graph is, informally, an object obtained from a simple undirecte...
research
05/31/2019

More on Numbers and Graphs

In this note we revisit a "ring of graphs" Q in which the set of finite ...
research
05/25/2019

Properly colored C_4's in edge-colored graphs

When many colors appear in edge-colored graphs, it is only natural to ex...
research
07/30/2021

A common variable minimax theorem for graphs

Let 𝒢 = {G_1 = (V, E_1), …, G_m = (V, E_m)} be a collection of m graphs ...

Please sign up or login with your details

Forgot password? Click here to reset