default search action
Péter Pál Pach
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Béla Bajnok, Péter Pál Pach:
On sumsets of nonbases of maximum size. Eur. J. Comb. 121: 103835 (2024) - 2023
- [j20]Péter Pál Pach, Máté Vizer:
Improved Lower Bounds for Multiplicative Square-Free Sequences. Electron. J. Comb. 30(4) (2023) - [j19]Zsolt Baja, Dániel Dobák, Benedek Kovács, Péter Pál Pach, Donát Pigler:
Towards characterizing the 2-Ramsey equations of the form ax + by = p(z). Discret. Math. 346(5): 113324 (2023) - 2022
- [j18]Hong Liu, Péter Pál Pach, Csaba Sándor:
Polynomial Schur's Theorem. Comb. 42(Supplement 2): 1357-1384 (2022) - [j17]János Nagy, Péter Pál Pach:
A counterexample to the lights out problem. J. Graph Theory 101(2): 265-273 (2022) - [j16]Péter Pál Pach, Richárd Palincza:
Sets Avoiding Six-Term Arithmetic Progressions in $\mathbb{Z}_6^{n}$ are Exponentially Small. SIAM J. Discret. Math. 36(2): 1135-1142 (2022) - 2021
- [j15]Andrés Eduardo Caicedo, Thomas A. C. Chartier, Péter Pál Pach:
Coloring the $n$-Smooth Numbers with $n$ Colors. Electron. J. Comb. 28(1): 1 (2021) - [j14]Hong Liu, Péter Pál Pach, Richárd Palincza:
The number of maximum primitive sets of integers. Comb. Probab. Comput. 30(5): 781-795 (2021) - 2020
- [j13]Christian Elsholtz
, Péter Pál Pach:
Caps and progression-free sets in ${{\mathbb {Z}}}_m^n$. Des. Codes Cryptogr. 88(10): 2133-2170 (2020) - [j12]Péter Pál Pach, Richárd Palincza:
The counting version of a problem of Erdős. Eur. J. Comb. 90: 103187 (2020)
2010 – 2019
- 2019
- [j11]Norbert Hegyvári, François Hennecart, Péter Pál Pach:
On the density of sumsets and product sets. Australas. J Comb. 74: 1-16 (2019) - [j10]Péter Pál Pach, Csaba Sándor:
On infinite multiplicative Sidon sets. Eur. J. Comb. 76: 37-52 (2019) - [j9]Daniel Král'
The step Sidorenko property and non-norming edge-transitive graphs. J. Comb. Theory A 162: 34-54 (2019) - [j8]Hong Liu, Péter Pál Pach:
The number of multiplicative Sidon sets of integers. J. Comb. Theory A 165: 152-175 (2019) - 2018
- [j7]Péter Pál Pach, Csaba Sándor:
Multiplicative Bases and an Erdős Problem. Comb. 38(5): 1175-1203 (2018) - 2014
- [j6]Mahsa Mirzargar, Péter Pál Pach, Ali Reza Ashrafi
Remarks On Commuting Graph of a Finite Group. Electron. Notes Discret. Math. 45: 103-106 (2014) - 2013
- [j5]Péter Pál Pach, Gabriella Pluhár, András Pongrácz
The Number of Rooted Trees of Given Depth. Electron. J. Comb. 20(2): 38 (2013) - [j4]Péter Pál Pach:
Ramsey Type Results on the Solvability of Certain Equation in Zm. Integers 13: A4 (2013) - [j3]Péter Pál Pach, Michael Pinsker
A new operation on partially ordered sets. J. Comb. Theory A 120(7): 1450-1462 (2013) - 2012
- [j2]Gábor Horváth, Kamilla Kátai-Urbán
On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices. Int. J. Algebra Comput. 22(7) (2012) - 2011
- [j1]Péter Pál Pach, Csaba A. Szabó:
On the minimal distance of a polynomial code. Discret. Math. Theor. Comput. Sci. 13(4): 33-44 (2011)
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-08-03 20:17 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: