István Tomon
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
István Tomon has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Bhargav Narayanan
University of Cambridge
6 shared publications - Julian Sahasrabudhe
Department of Mathematics University of Memphis Memphis Tennessee
3 shared publications Julian Sahasrabudhe
University of Memphis
1 shared publication
Latest Publications
- 7 February 2018
- Published by Springer Nature in Combinatorica
- Vol. 39 (1) , 215-237
Ramsey Graphs Induce Subgraphs of Many Different Sizes
- 7 February 2018
- Published by Springer Nature in Combinatorica
- Vol. 39 (1) , 215-237
Ramsey Graphs Induce Subgraphs of Many Different Sizes
- Open Access
Ramsey graphs induce subgraphs of many different sizes
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 \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed $C>0$, every $C$-Ramsey graph on $n$ vertices induces subgraphs of at least $n^{2-o(1)}$ distinct sizes. This near-optimal result is closely related to two unresolved conjectures, the first due to Erd\H{o}s and McKay and the second due to Erd\H{o}s, Faudree and S\'{o}s, both from 1992.Open AccessRamsey graphs induce subgraphs of many different sizes
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 \log n$. The only known constructions of Ramsey graphs are probabilistic in nature, and it is generally believed that such graphs possess many of the same properties as dense random graphs. Here, we demonstrate one such property: for any fixed $C>0$, every $C$-Ramsey graph on $n$ vertices induces subgraphs of at least $n^{2-o(1)}$ distinct sizes. This near-optimal result is closely related to two unresolved conjectures, the first due to Erd\H{o}s and McKay and the second due to Erd\H{o}s, Faudree and S\'{o}s, both from 1992. - 1 August 2017
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 27 (1) , 110-123
Induced Subgraphs With Many Distinct Degrees
Let hom(G) denote the size of the largest clique or independent set of a graphG. In 2007, Bukh and Sudakov proved that everyn-vertex graphGwith hom(G) =O(logn) contains an induced subgraph with Ω(n1/2) distinct degrees, and raised the question of deciding whether an analogous result holds for everyn-vertex graphGwith hom(G) =O(nϵ), whereϵ> 0 is a fixed constant. Here, we answer their question in the affirmative and show that every graphGonnvertices contains an induced subgraph with Ω((n/hom(G))1/2) distinct degrees. We also prove a stronger result for graphs with large cliques or independent sets and show, for any fixedk∈ ℕ, that if ann-vertex graphGcontains no induced subgraph withkdistinct degrees, then hom(G)⩾n/(k− 1) −o(n); this bound is essentially best possible.
- 1 August 2017
- Published by Cambridge University Press (CUP) in Combinatorics, Probability and Computing
- Vol. 27 (1) , 110-123
Induced Subgraphs With Many Distinct Degrees
Let hom(G) denote the size of the largest clique or independent set of a graphG. In 2007, Bukh and Sudakov proved that everyn-vertex graphGwith hom(G) =O(logn) contains an induced subgraph with Ω(n1/2) distinct degrees, and raised the question of deciding whether an analogous result holds for everyn-vertex graphGwith hom(G) =O(nϵ), whereϵ> 0 is a fixed constant. Here, we answer their question in the affirmative and show that every graphGonnvertices contains an induced subgraph with Ω((n/hom(G))1/2) distinct degrees. We also prove a stronger result for graphs with large cliques or independent sets and show, for any fixedk∈ ℕ, that if ann-vertex graphGcontains no induced subgraph withkdistinct degrees, then hom(G)⩾n/(k− 1) −o(n); this bound is essentially best possible.
- Open Access
Induced subgraphs with many distinct degrees
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(\log n)$ contains an induced subgraph with $\Omega(n^{1/2})$ distinct degrees, and raised the question of deciding whether an analogous result holds for every $n$-vertex graph $G$ with $\hom(G) = O(n^\epsilon)$, where $\epsilon > 0$ is a fixed constant. Here, we answer their question in the affirmative and show that every graph $G$ on $n$ vertices contains an induced subgraph with $\Omega((n/\hom(G))^{1/2})$ distinct degrees. We also prove a stronger result for graphs with large cliques or independent sets and show, for any fixed $k \in \mathbb{N}$, that if an $n$-vertex graph $G$ contains no induced subgraph with $k$ distinct degrees, then $\hom(G) \ge n/(k-1)-o(n)$; this bound is essentially best-possible.Open AccessInduced subgraphs with many distinct degrees
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(\log n)$ contains an induced subgraph with $\Omega(n^{1/2})$ distinct degrees, and raised the question of deciding whether an analogous result holds for every $n$-vertex graph $G$ with $\hom(G) = O(n^\epsilon)$, where $\epsilon > 0$ is a fixed constant. Here, we answer their question in the affirmative and show that every graph $G$ on $n$ vertices contains an induced subgraph with $\Omega((n/\hom(G))^{1/2})$ distinct degrees. We also prove a stronger result for graphs with large cliques or independent sets and show, for any fixed $k \in \mathbb{N}$, that if an $n$-vertex graph $G$ contains no induced subgraph with $k$ distinct degrees, then $\hom(G) \ge n/(k-1)-o(n)$; this bound is essentially best-possible. - 17 October 2016
- Published by Springer Nature in Combinatorica
- Vol. 37 (5) , 991-1010
The multiplication table problem for bipartite graphs
- 17 October 2016
- Published by Springer Nature in Combinatorica
- Vol. 37 (5) , 991-1010
The multiplication table problem for bipartite graphs
- Open Access
The multiplication table problem for bipartite graphs
We investigate the following generalisation of the 'multiplication table problem' of Erd\H{o}s: given a bipartite graph with $m$ edges, how large is the set of sizes of its induced subgraphs? Erd\H{o}s's problem of estimating the number of distinct products $ab$ with $a,b \le n$ is precisely the problem under consideration when the graph in question is the complete bipartite graph $K_{n,n}$. In this note, we prove that the set of sizes of the induced subgraphs of any bipartite graph with $m$ edges contains $\Omega(m/(\log m)^{12})$ distinct elements.Open AccessThe multiplication table problem for bipartite graphs
We investigate the following generalisation of the 'multiplication table problem' of Erd\H{o}s: given a bipartite graph with $m$ edges, how large is the set of sizes of its induced subgraphs? Erd\H{o}s's problem of estimating the number of distinct products $ab$ with $a,b \le n$ is precisely the problem under consideration when the graph in question is the complete bipartite graph $K_{n,n}$. In this note, we prove that the set of sizes of the induced subgraphs of any bipartite graph with $m$ edges contains $\Omega(m/(\log m)^{12})$ distinct elements.