From the 1 of 11 linked papers with an AI index.
11 papers · 1 filter
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…
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…
Ramsey Numbers in Kneser Graphs
Emily Heath, Grace McCourt, Alex Parker +2
We define the as the minimum integer such that every red/blue edge-coloring of the Kneser graph …
Odd Ramsey numbers of multipartite graphs and hypergraphs
Nicholas Crawford, Emily Heath, Owen Henderschedt +2
Given a hypergraph and a subhypergraph of , the \emph{odd Ramsey number} is the minimum number of colors needed to edge-color so that every copy of $H…
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…
Improved Tverberg theorems for certain families of polytopes
Pablo Soberón, Shira Zerbib
A theorem of Grünbaum, which states that every -polytope is a refinement of an -simplex, implies the following generalization of Tverberg's theorem: if is a linear funct…