Shira Zerbib

works on

chromatic number 1 graph coloring 1 kneser graphs 1 stable sets 1 topological combinatorics 1

From the 1 of 5 linked papers with an AI index.

collaborators

5 papers

math.CO2026

The chromatic number of 3-stable Kneser graphs

Wei-Chia Chen, Alex Parker, Shira Zerbib

The paper determines the chromatic number of 3‑stable Kneser graphs, confirming Meunier’s conjecture for the case s=3 (with sufficiently large n) and for k=s=3, using combinatorial…

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 $I^$ denote the 8-dimensional simplex viewed as an…