3 citations · 5 across the 7 of their papers we have counts for
7 papers
Counting subsets of integers free of arithmetic configurations
Patrick Morris, Miquel Ortega, Juanjo Rué
Cameron and Erdős asked if the number of sets free of arithmetic progressions of length is , where is the maximum cardinality of a -AP-free subs…
On the chromatic number of powers of subdivisions of graphs
Michael Anastos, Simona Boyadzhiyska, Silas Rathke +1
For a given graph , we define its \emph{th subdivision} as the graph obtained from by replacing every edge by a path of length . We also define the \emph{th p…
The Rado Multiplicity Problem in Vector Spaces over Finite Fields
Juanjo Rué, Christoph Spiegel
We study an analogue of the Ramsey multiplicity problem for additive structures, in particular establishing the minimum number of monochromatic 3-APs in 3-colorings of $\mathbb{F}_…
Product-free sets in the free group
Miquel Ortega, Juanjo Rué, Oriol Serra
We prove that product-free sets of the free group over a finite alphabet have maximum density with respect to the natural measure that assigns total weight one to each set of…
Random cubic planar maps
Michael Drmota, Marc Noy, Clément Requilé +1
We analyse uniform random cubic rooted planar maps and obtain limiting distributions for several parameters of interest. From the enumerative point of view, we present a unified ap…
Enumeration of labelled 4-regular planar graphs II: asymptotics
Marc Noy, Clément Requilé, Juanjo Rué
This work is a follow-up of the article [Proc.\ London Math.\ Soc.\ 119(2):358--378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In th…
On the probability of planarity of a random graph near the critical point
Marc Noy, Vlady Ravelomanana, Juanjo Rué
Consider the uniform random graph with vertices and edges. Erdős and Rényi (1960) conjectured that the limit $$ \lim_{n \to \infty} \Pr\{G(n,\textstyle{n\over 2})…