3 papers
math.CO2026
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…
math.CO2024
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…
math.CO2022
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…