István Tomon

activity

20142026

most citedOn the Turán number of some ordered even cycles

10 citations · 38 across the 54 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016★ 1 cited

Almost tiling of the Boolean lattice with copies of a poset

István Tomon

Let $P$ be a partially ordered set. If the Boolean lattice $(2^{[n]}, \subset)$ can be partitioned into copies of $P$ for some positive integer $n$ , then $P$ must satisfy the follow…

math.CO2016

Partitioning the Boolean lattice into copies of a poset

Vytautas Gruslys, Imre Leader, István Tomon

Let $P$ be a poset of size $2^{k}$ that has a greatest and a least element. We prove that, for sufficiently large $n$ , the Boolean lattice $2^{[n]}$ can be partitioned into copies of…

math.CO2016

Ramsey graphs induce subgraphs of many different sizes

Bhargav Narayanan, Julian Sahasrabudhe, István Tomon

A graph on $n$ vertices is said to be \emph{ $C$ -Ramsey} if every clique or independent set of the graph has size at most $C lo g n$ . The only known constructions of Ramsey graphs a…

math.CO2016

Induced subgraphs with many distinct degrees

Bhargav Narayanan, István Tomon

Let $hom (G)$ denote the size of the largest clique or independent set of a graph $G$ . In 2007, Bukh and Sudakov proved that every $n$ -vertex graph $G$ with $hom (G) = O (lo g n)$ c…