Aquest llibre conté una selecció de problemes resolts, així com un compendi de problemes sense resolució, corresponents a l’assignatura d’anàlisi real del grau de matemàtiques que s’imparteix a la Facultat de Matemàtiques ...

Consider the Erdos-Renyi random graph G(n, M) built with n vertices and M edges uniformly randomly chosen from the set of n2 edges. Let L be a set of positive integers. For any number of edges M 6n/2 + O(n 2/3 ), we compute ...

La expresión e¿ v163 es mucho más que la suma de sus partes e, ¿ y v163. Lejos de ser una elección casual, esta fórmula sirve a los autores de hilo conductor para adentrase en las áreas de la investigación más activa de ...

The goal of this paper is to obtain quantitative results on the number and on the size of maximal independent sets and maximal matchings in several block-stable graph classes that satisfy a proper sub-criticality condition. ...

This is a list of problems in combinatorial number theory gathered on the occasion of the meeting The Music of Numbers to honor the memory of the late Javier Cilleruelo (1961-2016).

We prove that for pairwise co-prime numbers k1,...,kd = 2 there does not exist any infinite set of positive integers A such that the representation function rA(n) = #{(a1,...,ad) ¿ Ad : k1a1 + ... + kdad = n} becomes ...

We prove that if 2 ≤ k1 ≤ k2, then there is no infinite sequence $\emph{A}$ of positive integers such that the representation function r(n)=#{(a, a'): n=$k{_1}a$ + $k{_2}a'$, a,a' ∊ $\emph{A}$} is constant for n large ...