Shira Zerbib

activity

20122026

G

so that every copy of a graph

H

has an odd color class

2 citations · 5 across the 11 of their papers we have counts for

collaborators

Showing math.COShow all

24 papers · 1 filter

math.CO2026

The chromatic number of 3-stable Kneser graphs

Wei-Chia Chen, Alex Parker, Shira Zerbib

For an integer $s \geq 2$ , a subset $S \subseteq [n]$ is {\em $s$ -stable} if $min {j - i, n + i - j} \geq s$ for every $i, j \in S$ with $i < j$ . Denote the set of all $s$ -stable subs…

math.CO2026

Generalized Ramsey Numbers in the Hypercube

Emily Heath, Coy Schwieder, Shira Zerbib

We study the generalized Ramsey numbers $f (Q_{n}, C_{k}, q)$ , that is, the minimum number of colors needed to edge-color the hypercube $Q_{n}$ so that every copy of the cycle $C_{k}$ h…

math.CO2025

Ramsey Numbers in Kneser Graphs

Emily Heath, Grace McCourt, Alex Parker +2

We define the $r -Kneser Ramsey number$ $R_{r}^{KG} (s, t)$ as the minimum integer $n$ such that every red/blue edge-coloring of the Kneser graph $KG (n, r)$ …

math.CO2025

Odd Ramsey numbers of multipartite graphs and hypergraphs

Nicholas Crawford, Emily Heath, Owen Henderschedt +2

Given a hypergraph $G$ and a subhypergraph $H$ of $G$ , the \emph{odd Ramsey number} $r_{o dd} (G, H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H…

math.CO2025

A topological product Tverberg Theorem

Andreas F. Holmsen, Grace McCourt, Daniel McGinnis +1

We prove a generalization of the topological Tverberg theorem. One special instance of our general theorem is the following: Let $Δ$ denote the 8-dimensional simplex viewed as an a…

math.CO2024

Using the KKM theorem

Daniel McGinnis, Shira Zerbib

The KKM theorem, due to Knaster, Kuratowski, and Mazurkiewicz in 1929, is a fundamental result in fixed-point theory, which has seen numerous extensions and applications. In this p…