Showing 2026Show all
2 papers · 1 filter
math.CO2026
A linear upper bound on the -Ramsey number of graphs with sufficiently large -packing
Emily Heath, Andrew Simmons
Given a positive integer and graph , the -Ramsey number is the least (if it exists) such that every coloring $f:E(K_N)\rightarrow \math…
math.CO2026
Generalized Ramsey Numbers in the Hypercube
Emily Heath, Coy Schwieder, Shira Zerbib
We study the generalized Ramsey numbers , that is, the minimum number of colors needed to edge-color the hypercube so that every copy of the cycle h…