Zsolt Adam Wagner

collaborators

3 papers

math.CO2017

Two results about the hypercube

Jozsef Balogh, Tamas Meszaros, Adam Zsolt Wagner

First we consider families in the hypercube $Q_{n}$ with bounded VC dimension. Frankl raised the problem of estimating the number $m (n, k)$ of maximal families of VC dimension $k$ . Al…

math.CO2017

Turán numbers for Berge-hypergraphs and related extremal problems

Cory Palmer, Michael Tait, Craig Timmons +1

Let $F$ be a graph. We say that a hypergraph $H$ is a {\it Berge}- $F$ if there is a bijection $f : E (F) \to E (H)$ such that $e \subseteq f (e)$ for every $e \in E (F)$ . Note…

math.CO2013

Cops and Robbers on diameter two graphs

Zsolt Adam Wagner

In this short paper we study the game of Cops and Robbers, played on the vertices of some fixed graph $G$ of order $n$ . The minimum number of cops required to capture a robber is c…