Shira Zerbib
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Shira Zerbib has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Eli Berger
University of Haifa
5 shared publications - Maria Chudnovsky
Mathematics Department, Princeton University, Princeton, NJ 08544 USA
5 shared publications - Ron Aharoni
Department of Mathematics, Technion, Haifa, Israel
5 shared publications Coy Schwieder
Iowa State University
3 shared publications- Emily Heath
Department of Mathematics and Statistics California State Polytechnic University Pomona California USA
3 shared publications - Francis Edward Su
University of Michigan and MSRI
3 shared publications
Latest Publications
- 31 October 2026
- Published by Wiley in Journal of Graph Theory
Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
Recently, Alon introduced the notion of an ‐code for a graph : a collection of graphs on vertex set is an ‐code if it contains no two members whose symmetric difference is isomorphic to . Let denote the maximum possible cardinality of an ‐code, and let . Alon observed that a lower bound on can be obtained by attaining an upper bound on the number of colors needed to edge‐color so that every copy of has an odd color class. Motivated by this observation, we define to be the minimum number of colors needed to edge‐color a graph so that every copy of has an odd color class. We prove and . The first result shows and was obtained independently in [9].
- 31 October 2026
- Published by Wiley in Journal of Graph Theory
Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
Recently, Alon introduced the notion of an ‐code for a graph : a collection of graphs on vertex set is an ‐code if it contains no two members whose symmetric difference is isomorphic to . Let denote the maximum possible cardinality of an ‐code, and let . Alon observed that a lower bound on can be obtained by attaining an upper bound on the number of colors needed to edge‐color so that every copy of has an odd color class. Motivated by this observation, we define to be the minimum number of colors needed to edge‐color a graph so that every copy of has an odd color class. We prove and . The first result shows and was obtained independently in [9].
- Open Access
Generalized Ramsey Numbers in the Hypercube
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}$ has at least $q$ colors. Our main result is that for any integers $k,q$ satisfying $k \geq 6$ and $3 \leq q \leq k/2+1$, we have $f(Q_n, C_{k}, q)= o\left( n^{\frac{k/2-1}{k-q+1}} \right).$ We also prove a few other upper and lower bounds in the special cases $k=4$ and $k=6$. This continues the line of research initiated by Faudree, Gyárfás, Lesniak, and Schelp and Mubayi and Stading who studied the case $k=q$, and by Conder who considered the case $k=6$ and $q=2$.Open AccessGeneralized Ramsey Numbers in the Hypercube
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}$ has at least $q$ colors. Our main result is that for any integers $k,q$ satisfying $k \geq 6$ and $3 \leq q \leq k/2+1$, we have $f(Q_n, C_{k}, q)= o\left( n^{\frac{k/2-1}{k-q+1}} \right).$ We also prove a few other upper and lower bounds in the special cases $k=4$ and $k=6$. This continues the line of research initiated by Faudree, Gyárfás, Lesniak, and Schelp and Mubayi and Stading who studied the case $k=q$, and by Conder who considered the case $k=6$ and $q=2$. - 16 January 2026
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 154 (3) , 1251-1260
A topological product Tverberg theorem
We prove a generalization of the topological Tverberg theorem. One special instance of our general theorem is the following: Let Δ \Delta denote the 8-dimensional simplex viewed as an abstract simplicial complex, and suppose that its vertices are arranged in a 3 × 3 3\times 3 array. Then for any continuous map f : Δ → R 3 f:\Delta \to \mathbb {R}^3 it is possible to partition the rows or the columns of the vertex array into two parts, such that the disjoint faces σ \sigma and τ \tau induced by the two parts satisfy f ( σ ) ∩ f ( τ ) ≠ ∅ f(\sigma )\cap f(\tau ) \neq \emptyset . Our result also has consequences for geometric transversals and topological Helly theorems.
- 16 January 2026
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 154 (3) , 1251-1260
A topological product Tverberg theorem
We prove a generalization of the topological Tverberg theorem. One special instance of our general theorem is the following: Let Δ \Delta denote the 8-dimensional simplex viewed as an abstract simplicial complex, and suppose that its vertices are arranged in a 3 × 3 3\times 3 array. Then for any continuous map f : Δ → R 3 f:\Delta \to \mathbb {R}^3 it is possible to partition the rows or the columns of the vertex array into two parts, such that the disjoint faces σ \sigma and τ \tau induced by the two parts satisfy f ( σ ) ∩ f ( τ ) ≠ ∅ f(\sigma )\cap f(\tau ) \neq \emptyset . Our result also has consequences for geometric transversals and topological Helly theorems.
- Open Access
Odd Ramsey numbers of multipartite graphs and hypergraphs
Given a hypergraph $G$ and a subhypergraph $H$ of $G$, the \emph{odd Ramsey number} $r_{odd}(G,H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H$ intersects some color class in an odd number of edges. Generalizing a result of \cite{BHZ} in two different ways, in this paper we prove $r_{odd} \left(K_{n,n}, K_{2,t} \right)=\frac{n}{t} + o(n)$ for all $t\geq 2$, and $r_{odd} \left(\mathcal{K}^{(k)}_{n,\dots,n}, \mathcal{K}_{1,\dots,1,2,2} \right) = \frac{n}{2} + o(n)$ for all $k\geq 2$. The latter is the first result studying odd Ramsey numbers for hypergraphs.Open AccessOdd Ramsey numbers of multipartite graphs and hypergraphs
Given a hypergraph $G$ and a subhypergraph $H$ of $G$, the \emph{odd Ramsey number} $r_{odd}(G,H)$ is the minimum number of colors needed to edge-color $G$ so that every copy of $H$ intersects some color class in an odd number of edges. Generalizing a result of \cite{BHZ} in two different ways, in this paper we prove $r_{odd} \left(K_{n,n}, K_{2,t} \right)=\frac{n}{t} + o(n)$ for all $t\geq 2$, and $r_{odd} \left(\mathcal{K}^{(k)}_{n,\dots,n}, \mathcal{K}_{1,\dots,1,2,2} \right) = \frac{n}{2} + o(n)$ for all $k\geq 2$. The latter is the first result studying odd Ramsey numbers for hypergraphs. - Open Access
Using the KKM theorem
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 paper we survey old and recent generalizations of the KKM theorem and their applications in the areas of piercing numbers, mass partition, fair division, and matching theory. We also give a few new results utilizing KKM-type theorems, and discuss related open problems.
Open AccessUsing the KKM theorem
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 paper we survey old and recent generalizations of the KKM theorem and their applications in the areas of piercing numbers, mass partition, fair division, and matching theory. We also give a few new results utilizing KKM-type theorems, and discuss related open problems.
- 27 March 2024
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 59 (4) , 761-785
Matchings in matroids over abelian groups
- 27 March 2024
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 59 (4) , 761-785
Matchings in matroids over abelian groups
- Open AccessNew bounds on the generalized Ramsey number $f(n,5,8)$Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\frac{6}{7}(n-1) \leq f(n,5,8) \leq n + o(n)$. The upper bound is proven using the "conflict-free hypergraph matchings method" which was recently used by Mubayi and Joos to prove $f(n,4,5) = \frac{5}{6}n + o(n)$.Open AccessNew bounds on the generalized Ramsey number $f(n,5,8)$Let $f(n,p,q)$ denote the minimum number of colors needed to color the edges of $K_n$ so that every copy of $K_p$ receives at least $q$ distinct colors. In this note, we show $\frac{6}{7}(n-1) \leq f(n,5,8) \leq n + o(n)$. The upper bound is proven using the "conflict-free hypergraph matchings method" which was recently used by Mubayi and Joos to prove $f(n,4,5) = \frac{5}{6}n + o(n)$.
- 24 November 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
Bounds on piercing and line-piercing numbers in families of convex sets in the plane
- 24 November 2023
- Published by Elsevier in Discrete Mathematics
- Vol. 347 (3)
Bounds on piercing and line-piercing numbers in families of convex sets in the plane
- Open Access
Graphs with no even holes and no sector wheels are the union of two chordal graphs
Sivaraman conjectured that if $G$ is a graph with no induced even cycle then there exist sets $X_1, X_2 \subseteq V(G)$ satisfying $V(G) = X_1 \cup X_2$ such that the induced graphs $G[X_1]$ and $G[X_2]$ are both chordal. We prove this conjecture in the special case where $G$ contains no sector wheel, namely, a pair $(H, w)$ where $H$ is an induced cycle of $G$ and $w$ is a vertex in $V(G) \setminus V(H)$ such that $N(w) \cap H$ is either $V(H)$ or a path with at least three vertices.Open AccessGraphs with no even holes and no sector wheels are the union of two chordal graphs
Sivaraman conjectured that if $G$ is a graph with no induced even cycle then there exist sets $X_1, X_2 \subseteq V(G)$ satisfying $V(G) = X_1 \cup X_2$ such that the induced graphs $G[X_1]$ and $G[X_2]$ are both chordal. We prove this conjecture in the special case where $G$ contains no sector wheel, namely, a pair $(H, w)$ where $H$ is an induced cycle of $G$ and $w$ is a vertex in $V(G) \setminus V(H)$ such that $N(w) \cap H$ is either $V(H)$ or a path with at least three vertices. - Open AccessEdge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color classRecently, Alon introduced the notion of an $H$-code for a graph $H$: a collection of graphs on vertex set $[n]$ is an $H$-code if it contains no two members whose symmetric difference is isomorphic to $H$. Let $D_{H}(n)$ denote the maximum possible cardinality of an $H$-code, and let $d_{H}(n)=D_{H}(n)/2^{n \choose 2}$. Alon observed that a lower bound on $d_{H}(n)$ can be obtained by attaining an upper bound on the number of colors needed to edge-color $K_n$ so that every copy of $H$ has an odd color class. Motivated by this observation, we define $g(G,H)$ to be the minimum number of colors needed to edge-color a graph $G$ so that every copy of $H$ has an odd color class. We prove $g(K_n,K_5) \le n^{o(1)}$ and $g(K_{n,n}, C_4)= n/2+o(n)$. The first result shows $d_{K_5}(n) \ge \frac{1}{n^{o(1)}}$ and was obtained independently in arXiv:2306.14682.Open AccessEdge-coloring a graph $G$ so that every copy of a graph $H$ has an odd color classRecently, Alon introduced the notion of an $H$-code for a graph $H$: a collection of graphs on vertex set $[n]$ is an $H$-code if it contains no two members whose symmetric difference is isomorphic to $H$. Let $D_{H}(n)$ denote the maximum possible cardinality of an $H$-code, and let $d_{H}(n)=D_{H}(n)/2^{n \choose 2}$. Alon observed that a lower bound on $d_{H}(n)$ can be obtained by attaining an upper bound on the number of colors needed to edge-color $K_n$ so that every copy of $H$ has an odd color class. Motivated by this observation, we define $g(G,H)$ to be the minimum number of colors needed to edge-color a graph $G$ so that every copy of $H$ has an odd color class. We prove $g(K_n,K_5) \le n^{o(1)}$ and $g(K_{n,n}, C_4)= n/2+o(n)$. The first result shows $d_{K_5}(n) \ge \frac{1}{n^{o(1)}}$ and was obtained independently in arXiv:2306.14682.