default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 36 matches
- 2024
- Oliver Janzer, Benny Sudakov, István Tomon:
Small Subgraphs with Large Average Degree. Comb. 44(4): 785-800 (2024) - István Tomon:
Coloring lines and Delaunay graphs with respect to boxes. Random Struct. Algorithms 64(3): 645-662 (2024) - István Tomon:
Tiling with Monotone Polyominos. Am. Math. Mon. 131(1): 60-65 (2024) - Nóra Frankl, Attila Jung, István Tomon:
The Quantitative Fractional Helly theorem. CoRR abs/2402.12268 (2024) - 2023
- Zhihan Jin, István Tomon:
Ramsey numbers of semi-algebraic and semi-linear hypergraphs. J. Comb. Theory B 163: 54-82 (2023) - Oliver Janzer, Benny Sudakov, István Tomon:
Small subgraphs with large average degree. SODA 2023: 2345-2353 - Benny Sudakov, István Tomon:
Matrix discrepancy and the log-rank conjecture. CoRR abs/2311.18524 (2023) - 2022
- Abhishek Methuku, István Tomon:
Bipartite Turán Problems for Ordered Graphs. Comb. 42(6): 895-911 (2022) - István Tomon:
A Sharp Threshold Phenomenon in String Graphs. Discret. Comput. Geom. 67(1): 338-359 (2022) - Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Infinite Sperner's theorem. J. Comb. Theory A 187: 105558 (2022) - Benny Sudakov, István Tomon, Adam Zsolt Wagner:
Uniform chain decompositions and applications. Random Struct. Algorithms 60(2): 261-286 (2022) - 2021
- István Tomon, Dmitriy Zakharov:
Turán-type results for intersection graphs of boxes. Comb. Probab. Comput. 30(6): 982-987 (2021) - János Pach, István Tomon:
Erdős-Hajnal-type results for monotone paths. J. Comb. Theory B 151: 21-37 (2021) - 2020
- Dániel Korándi, István Tomon:
Improved Ramsey-type results for comparability graphs. Comb. Probab. Comput. 29(5): 747-756 (2020) - János Pach, István Tomon:
On the chromatic number of disjointness graphs of curves. J. Comb. Theory B 144: 167-190 (2020) - Dániel Korándi, János Pach, István Tomon:
Large Homogeneous Submatrices. SIAM J. Discret. Math. 34(4): 2532-2552 (2020) - 2019
- Andrey Kupavskii, János Pach, István Tomon:
On the Size of K-Cross-Free Families. Comb. 39(1): 153-164 (2019) - Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
Ramsey Graphs Induce Subgraphs of Many Different Sizes. Comb. 39(1): 215-237 (2019) - János Pach, István Tomon:
Ordered graphs and large bi-cliques in intersection graphs of curves. Eur. J. Comb. 82 (2019) - Vytautas Gruslys, Imre Leader, István Tomon:
Partitioning the Boolean lattice into copies of a poset. J. Comb. Theory A 161: 81-98 (2019) - 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) - István Tomon:
Forbidden induced subposets of given height. J. Comb. Theory A 161: 537-562 (2019) - János Pach, István Tomon:
On the Chromatic Number of Disjointness Graphs of Curves. SoCG 2019: 54:1-54:17 - János Pach, István Tomon:
Coloring Hasse Diagrams and Disjointness Graphs of Curves. GD 2019: 244-250 - 2018
- István Tomon:
Almost Tiling of the Boolean Lattice with Copies of a Poset. Electron. J. Comb. 25(1): 1 (2018) - Bhargav P. Narayanan, István Tomon:
Induced Subgraphs With Many Distinct Degrees. Comb. Probab. Comput. 27(1): 110-123 (2018) - 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
- Bhargav P. Narayanan, Julian Sahasrabudhe, István Tomon:
The multiplication table problem for bipartite graphs. Comb. 37(5): 991-1010 (2017) - Vytautas Gruslys, Imre Leader, István Tomon:
Tiling the Boolean lattice with copies of a poset. Electron. Notes Discret. Math. 61: 535-539 (2017) - 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)
skipping 6 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-01 04:45 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint