default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIstván Tomon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j31]Oliver Janzer, Benny Sudakov, István Tomon:
Small Subgraphs with Large Average Degree. Comb. 44(4): 785-800 (2024)- [j30]István Tomon
:
Coloring lines and Delaunay graphs with respect to boxes. Random Struct. Algorithms 64(3): 645-662 (2024) - [j29]István Tomon:
Tiling with Monotone Polyominos. Am. Math. Mon. 131(1): 60-65 (2024) - [i3]Nóra Frankl, Attila Jung, István Tomon:
The Quantitative Fractional Helly theorem. CoRR abs/2402.12268 (2024) - [i2]Eero Räty, István Tomon:
Bisection Width, Discrepancy, and Eigenvalues of Hypergraphs. CoRR abs/2409.15140 (2024) - 2023
- [j28]Zhihan Jin, István Tomon:
Ramsey numbers of semi-algebraic and semi-linear hypergraphs. J. Comb. Theory B 163: 54-82 (2023) - [c3]Oliver Janzer, Benny Sudakov, István Tomon:
Small subgraphs with large average degree. SODA 2023: 2345-2353 - [i1]Benny Sudakov, István Tomon:
Matrix discrepancy and the log-rank conjecture. CoRR abs/2311.18524 (2023) - 2022
- [j27]Abhishek Methuku, István Tomon:
Bipartite Turán Problems for Ordered Graphs. Comb. 42(6): 895-911 (2022) - [j26]István Tomon:
A Sharp Threshold Phenomenon in String Graphs. Discret. Comput. Geom. 67(1): 338-359 (2022) - [j25]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Infinite Sperner's theorem. J. Comb. Theory A 187: 105558 (2022) - [j24]Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Uniform chain decompositions and applications. Random Struct. Algorithms 60(2): 261-286 (2022) - 2021
- [j23]István Tomon, Dmitriy Zakharov:
Turán-type results for intersection graphs of boxes. Comb. Probab. Comput. 30(6): 982-987 (2021) - [j22]János Pach, István Tomon:
Erdős-Hajnal-type results for monotone paths. J. Comb. Theory B 151: 21-37 (2021) - 2020
- [j21]Dániel Korándi, István Tomon:
Improved Ramsey-type results for comparability graphs. Comb. Probab. Comput. 29(5): 747-756 (2020) - [j20]János Pach, István Tomon:
On the chromatic number of disjointness graphs of curves. J. Comb. Theory B 144: 167-190 (2020) - [j19]Dániel Korándi, János Pach, István Tomon:
Large Homogeneous Submatrices. SIAM J. Discret. Math. 34(4): 2532-2552 (2020)
2010 – 2019
- 2019
- [j18]Andrey Kupavskii, János Pach, István Tomon:
On the Size of K-Cross-Free Families. Comb. 39(1): 153-164 (2019) - [j17]Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
Ramsey Graphs Induce Subgraphs of Many Different Sizes. Comb. 39(1): 215-237 (2019) - [j16]János Pach, István Tomon:
Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. 82 (2019) - [j15]Vytautas Gruslys, Imre Leader, István Tomon:
Partitioning the Boolean lattice into copies of a poset. J. Comb. Theory A 161: 81-98 (2019) - [j14]István Tomon:
Forbidden induced subposets of given height. J. Comb. Theory A 161: 537-562 (2019) - [j13]Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert:
On the Turán number of ordered forests. J. Comb. Theory A 165: 32-43 (2019) - [c2]János Pach, István Tomon:
On the Chromatic Number of Disjointness Graphs of Curves. SoCG 2019: 54:1-54:17 - [c1]János Pach, István Tomon:
Coloring Hasse Diagrams and Disjointness Graphs of Curves. GD 2019: 244-250 - 2018
- [j12]István Tomon:
Almost Tiling of the Boolean Lattice with Copies of a Poset. Electron. J. Comb. 25(1): 1 (2018) - [j11]Bhargav P. Narayanan, István Tomon:
Induced Subgraphs With Many Distinct Degrees. Comb. Probab. Comput. 27(1): 110-123 (2018) - [j10]Ervin Györi, Dániel Korándi, Abhishek Methuku, István Tomon, Casey Tompkins, Máté Vizer:
On the Turán number of some ordered even cycles. Eur. J. Comb. 73: 81-88 (2018) - 2017
- [j9]Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
The multiplication table problem for bipartite graphs. Comb. 37(5): 991-1010 (2017) - [j8]Vytautas Gruslys, Imre Leader, István Tomon:
Tiling the Boolean lattice with copies of a poset. Electron. Notes Discret. Math. 61: 535-539 (2017) - [j7]Dániel Korándi, Gábor Tardos, István Tomon, Craig Weidert:
On the Turán number of ordered forests. Electron. Notes Discret. Math. 61: 773-779 (2017) - [j6]Stephen G. Z. Smith, István Tomon:
The poset on connected graphs is Sperner. J. Comb. Theory A 150: 162-181 (2017) - 2016
- [j5]István Tomon:
Decompositions of the Boolean Lattice into Rank-symmetric Chains. Electron. J. Comb. 23(2): 2 (2016) - [j4]István Tomon:
Improved bounds on the partitioning of the Boolean lattice into chains of equal size. Discret. Math. 339(1): 333-343 (2016) - [j3]István Tomon:
Turán-Type Results for Complete h-Partite Graphs in Comparability and Incomparability Graphs. Order 33(3): 537-556 (2016) - 2015
- [j2]István Tomon:
On the number of occurrences of the kth smallest distance between points in convex position. Discret. Math. 338(6): 990-993 (2015) - [j1]István Tomon:
On a conjecture of Füredi. Eur. J. Comb. 49: 1-12 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
