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 2019Show all

5 papers · 1 filter

math.CO2019★ 2 cited

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 $H$ and $F$ and an integer $n$ , what is the maximum number of copies…

math.CO2019

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…

math.CO2019★ 3 cited

Exploring Projective Norm Graphs

Tomas Bayer, Tamás Mészáros, Lajos Rónyai +1

The projective norm graphs $NG (q, t)$ provide tight constructions for the Turán number of complete bipartite graphs $K_{t, s}$ with $s > (t - 1)!$ . In this paper we determine thei…

math.CO2019

Standard monomials and extremal point sets

Tamás Mészáros

We say that a set system $F \subseteq 2^{[n]}$ shatters a set $S \subseteq [n]$ if every possible subset of $S$ appears as the intersection of $S$ with some element of $\ma…

math.CO2019

Ramsey games near the critical threshold

David Conlon, Shagnik Das, Joonkyung Lee +1

A well-known result of Rödl and Ruciński states that for any graph $H$ there exists a constant $C$ such that if $p \geq C n^{- 1/ m_{2} (H)}$ , then the random graph $G_{n, p}$ is a.a.s.…