Jasmin Katz

collaborators

3 papers

math.CO2026

A degree version of the Burr-ErdÅs conjecture on trees

Jasmin Katz, MatÃas Pavez-SignÃ©, Jozef Skokan

An old conjecture of Burr and Erd\H os states that the Ramsey number of any $n$ -vertex tree $T$ is at most $2 n - 2$ . In 2012, Schelp asked whether a degree version of the Burr--ErdÅ…

math.CO2026

A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs

Jasmin Katz, Xiaopan Lian, Alexandru Malekshahian +1

Let $G$ be a graph and $I^$ a finite abelian group. The zero-sum Ramsey number of $G$ over $I^$ , denoted by $R (G, I^)$ , is the smallest positive integer $t$ (if it exists) such tha…

math.CO2025

Bounds for Hypergraph Universality

Peter Allen, Julia BÃ¶ttcher, Jasmin Katz

A graph $I^$ is said to be universal for a class of graphs $H$ if $I^$ contains a copy of every $H \in H$ as a subgraph. The number of edges required for a host…

A degree version of the Burr-ErdÅs conjecture on trees

A linear upper bound for zero-sum Ramsey numbers of bounded degree graphs

Bounds for Hypergraph Universality

A degree version of the Burr-ErdÅs conjecture on trees