A bijective proof of an identity for noncrossing graphs

Authors:
Pavel Podbrdský
Affiliations:
Department of Applied Mathematics, Charles University, Malostranské námestí, 25, 118 00 Prague Czech Republic
Venue:
Discrete Mathematics
Year:
2003

Citing 2
Cited 1

Enumerative combinatorics

Enumerative combinatorics
Analytic combinatorics of non-crossing configurations

Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould

Extremal problems for ordered hypergraphs: small patterns and some enumeration

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

We give a bijective proof for the identity an+2 = 8bn, where an is the number of noncrossing simple graphs with n (possibly isolated) vertices and bn is the number of noncrossing graphs without isolated vertices and with n (possibly multiple) edges.