22 citations · 99 across the 48 of their papers we have counts for
67 papers
The generalized trifference problem
Anurag Bishnoi, Bartłomiej Kielak, Benedek Kovács +4
We study the problem of finding the largest number of ternary vectors of length such that for any three distinct vectors there are at least coordinates where they…
Generalized saturation game
Balázs Patkós, Miloš Stojaković, Jelena Stratijev +1
We study the following game version of the generalized graph Turán problem. For two fixed graphs F and H, two players, Max and Mini, alternately claim unclaimed edges of the comple…
Edge mappings of graphs: Turán type parameters
Yair Caro, Balázs Patkós, Zsolt Tuza +1
In this paper, we address problems related to parameters concerning edge mappings of graphs. The quantity is defined to be the maximum number of edges in an -vertex gra…
Edge mappings of graphs: Ramsey type parameters
Yair Caro, Balázs Patkós, Zsolt Tuza +1
In this paper, we launch a systematic study of parameters concerning edge mappings of graphs. Inspired by Ramsey's theorem, the quantity is defined to be the smallest inte…
The robust chromatic number of certain graph classes
Gábor Bacsó, Csilla Bujtás, Balázs Patkós +2
A 1-selection of a graph is a function such that is incident to for every vertex . The 1-removed is the graph $(V(G),E(G)\setm…
The robust chromatic number of graphs
Gábor Bacsó, Balázs Patkós, Zsolt Tuza +1
A 1-removed subgraph of a graph is obtained by selecting at most one edge for each vertex , such that (the mapping $f:V\to E \…