Péter Pál Pach

According to our database1, Péter Pál Pach authored at least 20 papers between 2011 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Towards characterizing the 2-Ramsey equations of the form <i>ax</i> + <i>by</i> = <i>p</i>(<i>z</i>).
Discret. Math., May, 2023

Improved Lower Bounds for Multiplicative Square-Free Sequences.
Electron. J. Comb., 2023

2022
Polynomial Schur's Theorem.
Comb., December, 2022

Sets Avoiding Six-Term Arithmetic Progressions in $\mathbb{Z}_6^{n}$ are Exponentially Small.
SIAM J. Discret. Math., 2022

A counterexample to the lights out problem.
J. Graph Theory, 2022

2021
The number of maximum primitive sets of integers.
Comb. Probab. Comput., 2021

Coloring the $n$-Smooth Numbers with $n$ Colors.
Electron. J. Comb., 2021

2020
The counting version of a problem of Erdős.
Eur. J. Comb., 2020

Caps and progression-free sets in ${{\mathbb {Z}}}_m^n$.
Des. Codes Cryptogr., 2020

2019
The number of multiplicative Sidon sets of integers.
J. Comb. Theory, Ser. A, 2019

The step Sidorenko property and non-norming edge-transitive graphs.
J. Comb. Theory, Ser. A, 2019

On infinite multiplicative Sidon sets.
Eur. J. Comb., 2019

On the density of sumsets and product sets.
Australas. J Comb., 2019

2018
Multiplicative Bases and an Erdős Problem.
Comb., 2018

2014
Remarks On Commuting Graph of a Finite Group.
Electron. Notes Discret. Math., 2014

2013
A new operation on partially ordered sets.
J. Comb. Theory, Ser. A, 2013

Ramsey Type Results on the Solvability of Certain Equation in Zm.
Integers, 2013

The Number of Rooted Trees of Given Depth.
Electron. J. Comb., 2013

2012
On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices.
Int. J. Algebra Comput., 2012

2011
On the minimal distance of a polynomial code.
Discret. Math. Theor. Comput. Sci., 2011


  Loading...