5 citations · 27 across the 19 of their papers we have counts for
4 papers · 1 filter
On Ramsey numbers of complete graphs with dropped stars
Jonathan Chappelon, Luis Pedro Montejano, Jorge Ramírez Alfonsín
Let be the smallest integer such that for any -coloring (say, red and blue) of the edges of , , there is either a red copy of or a blue copy…
Ramsey for complete graphs with dropped cliques
Jonathan Chappelon, Luis Pedro Montejano, Jorge Luis Ramírez Alfonsín
Let be the complete graph on vertices from which a set of edges, induced by a clique of order , has been dropped. In this note we give two explicit upper bounds…
Modular Schur numbers
Jonathan Chappelon, María Pastora Revuelta Marchena, María Isabel Sanz Domínguez
For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements satisfying the co…
Connected covering numbers
Jonathan Chappelon, Kolja Knauer, Luis Pedro Montejano +1
A connected covering is a design system in which the corresponding {\em block graph} is connected. The minimum size of such coverings are called {\em connected coverings numbers}.…