5 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2021
Book free -Uniform Hypergraphs
Debarun Ghosh, Ervin Győri, Judit Nagy-György +3
A -book in a hypergraph consists of Berge triangles sharing a common edge. In this paper we prove that the number of the hyperedges in a -book-free 3-uniform hypergraph o…
cs.FL2014
Biclique coverings, rectifier networks and the cost of -removal
Szabolcs Iván, Ádám Dániel Lelkes, Judit Nagy-György +2
We relate two complexity notions of bipartite graphs: the minimal weight biclique covering number and the minimal rectifier network size of a b…
cs.FL2014★ 5 cited
On nonpermutational transformation semigroups with an application to syntactic complexity
Szabolcs Ivan, Judit Nagy-Gyorgy
We give an upper bound of for the possible largest size of a subsemigroup of the full transformational semigroup over elements consisting only of nonpermutat…