T. Mészáros

activity

20122019

collaborators

9 papers

math.CO2019

Greedy maximal independent sets via local limits

Michael Krivelevich, Tamás Mészáros, Peleg Michaeli +1

The random greedy algorithm for finding a maximal independent set in a graph constructs a maximal independent set by inspecting the graph's vertices in a random order, adding the c…

math.CO2018

Boolean Dimension, Components and Blocks

Tamás Mészáros, Piotr Micek, William T. Trotter

We investigate the behavior of Boolean dimension with respect to components and blocks. To put our results in context, we note that for Dushnik-Miller dimension, we have that if $\…

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

Shattering-extremal set systems from Sperner families

Christopher Kusch, Tamás Mészáros

We say that a set system $F \subseteq 2^{[n]}$ shatters a given set $S \subseteq [n]$ if $2^{S} = {F \cap S : F \in F}$ . The Sauer-Shelah lemma states that in gener…

math.CO2017

Boolean dimension and tree-width

Stefan Felsner, Tamás Mészáros, Piotr Micek

The dimension is a key measure of complexity of partially ordered sets. Small dimension allows succinct encoding. Indeed if $P$ has dimension $d$ , then to know whether $x \leq y$ i…

math.CO2017

A Semi-Random Construction of Small Covering Arrays

Shagnik Das, Tamás Mészáros

Given a set $S$ of $v \geq 2$ symbols, and integers $k \geq t \geq 2$ and $N \geq 1$ , an $N \times k$ array $A \in S^{N \times k}$ is an $(N; t, k, v)$ -covering array if all sequences…