1 citations · 1 across the 7 of their papers we have counts for
7 papers
On the damage number of graphs
Valentin Gledel, William B. Kinnersley, Balázs Patkós +1
We study a variant of Cops and Robbers in which the robber attempts to visit as many vertices of the graph as possible without being captured, while the cop aims to keep the robber…
On graphs that contain exactly k copies of a subgraph, and a related problem in search theory
Dániel Gerbner, Balázs Keszegh, Dániel Lenger +5
We study , the largest number of edges in an -vertex graph that contains exactly copies of a given subgraph . The case is the Turán number…
On the sizes of -intersecting -chain-free families
József Balogh, William B. Linz, Balázs Patkós
A set system is -\textit{intersecting}, if the size of the intersection of every pair of its elements has size at least . A set system is -\tex…
Connected Turán number of trees
Yair Caro, Balázs Patkós, Zsolt Tuza
As a variant of the much studied Turán number, , the largest number of edges that an -vertex -free graph may contain, we introduce the connected Turán number $ex_c(n…
On the number of maximal independent sets: From Moon-Moser to Hujter-Tuza
Cory Palmer, Balázs Patkós
We connect two classical results in extremal graph theory concerning the number of maximal independent sets. The maximum number mis of maximal independent sets in an -verte…
The Constructor-Blocker Game
Balázs Patkós, Miloš Stojaković, Máté Vizer
We study the following game version of the generalized graph Turán problem. For two fixed graphs and , two players, Constructor and Blocker, alternately claim unclaimed edge…
Triangles in intersecting families
Dániel T. Nagy, Balázs Patkós
We prove the following the generalized Turán type result. A collection of sets is an -triangle if for every we have $\ca…