2 citations · 2 across the 3 of their papers we have counts for
8 papers
Zero sum cycles in complete digraphs
Tamás Mészáros, Raphael Steiner
Given a non-trivial finite Abelian group , let be the smallest integer such that for every labelling of the arcs of the bidirected complete graph of order $n(A)…
Subspace coverings with multiplicities
Anurag Bishnoi, Simona Boyadzhiyska, Shagnik Das +1
We study the problem of determining the minimum number of affine subspaces of codimension that are required to cover all points of $\mathbb{F}_2^n\setminus \{\vec{0}…
Complete minors in digraphs with given dichromatic number
Tamás Mészáros, Raphael Steiner
The dichromatic number of a digraph is the smallest for which it admits a -coloring where every color class induces an acyclic subgraph. Inspired by Hadwiger'…
Generalized rainbow Turán problems
Dániel Gerbner, Tamás Mészáros, Abhishek Methuku +1
Alon and Shikhelman initiated the systematic study of the following generalized Turán problem: for fixed graphs and and an integer , what is the maximum number of copies…
Singer difference sets and the projective norm graph
Tamás Mészáros, Lajos Rónyai, Tibor Szabó
We demonstrate a close connection between the classic planar Singer difference sets and certain norm equation systems arising from projective norm graphs. This, on the one hand lea…
Exploring Projective Norm Graphs
Tomas Bayer, Tamás Mészáros, Lajos Rónyai +1
The projective norm graphs provide tight constructions for the Turán number of complete bipartite graphs with . In this paper we determine thei…