From the 1 of 4 linked papers with an AI index.
4 papers
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…
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 …
Frogs, hats and common subsequences
Joseph Briggs, Alex Parker, Coy Schwieder +1
Write to mean the -letter word obtained by repeating a fixed word and let denote a uniformly random -letter word sampled from the same alphabet as . We…
On the proper rainbow saturation numbers of cliques, paths, and odd cycles
Dustin Baker, Enrique Gomez-Leos, Anastasia Halfpap +7
Given a graph , we say a graph is properly rainbow -saturated if there is a proper edge-coloring of which contains no rainbow copy of , but adding any edge to …