Gábor V. Nagy

activity

20122019

most citedA simple combinatorial proof of Shapiro's Catalan convolution

8 citations · 12 across the 3 of their papers we have counts for

collaborators

4 papers

math.CO2019

Lonesum and $Γ$ -free $0$ - $1$ fillings of Ferrers shapes

Gábor V. Nagy, Beáta Bényi

We show that $Γ$ -free fillings and lonesum fillings of Ferrers shapes are equinumerous by applying a previously defined bijection on matrices for this more general case and by cons…

math.CO2017★ 4 cited

Bijective enumerations of $Γ$ -free 0-1 matrices

Beáta Bényi, Gábor V. Nagy

We construct a new bijection between the set of $n \times k$ $0$ - $1$ matrices with no three $1$ 's forming a $Γ$ configuration and the set of $(n, k)$ -Callan sequences, a simple struc…

math.CO2015

On the staircases of Gyárfás

János Csányi, Peter Hajnal, Gábor V. Nagy

Gyárfás investigated a geometric Ramsey problem on convex, separated, balanced, geometric $K_{n, n}$ . This led to appealing extremal problem on square $0$ - $1$ matrices. Gyárfás conj…

math.CO2012★ 8 cited

A simple combinatorial proof of Shapiro's Catalan convolution

Gábor V. Nagy

Shapiro proved an elegant convolution formula involving Catalan numbers of even index. This paper gives a simple combinatorial proof of his formula. In addition, we show that it is…

Lonesum and Γ-free 0-1 fillings of Ferrers shapes

Bijective enumerations of Γ-free 0-1 matrices

On the staircases of Gyárfás

A simple combinatorial proof of Shapiro's Catalan convolution

Lonesum and $Γ$ -free $0$ - $1$ fillings of Ferrers shapes

Bijective enumerations of $Γ$ -free 0-1 matrices