Tamás Mészáros

activity

20112021

most citedExploring Projective Norm Graphs

3 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021

Zero sum cycles in complete digraphs

Tamás Mészáros, Raphael Steiner

Given a non-trivial finite Abelian group $(A, +)$ , let $n (A) \geq 2$ be the smallest integer such that for every labelling of the arcs of the bidirected complete graph of order $n(A)…

math.CO2021

Subspace coverings with multiplicities

Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das +1

We study the problem of determining the minimum number $f (n, k, d)$ of affine subspaces of codimension $d$ that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}…

math.CO2021

Complete minors in digraphs with given dichromatic number

Tamás Mészáros, Raphael Steiner

The dichromatic number $χ (D)$ of a digraph $D$ is the smallest $k$ for which it admits a $k$ -coloring where every color class induces an acyclic subgraph. Inspired by Hadwiger'…