Adam M. Lehavi

collaborators

3 papers

math.CO2024

Ramsey Number Counterexample Checking and One Vertex Extension Linearly Bound by $s$ and $t$

Adam M. Lehavi

The Ramsey number $R (s, t)$ is the smallest integer $n$ such that all graphs of size $n$ contain a clique of size $s$ or an independent set of size $t$ . $R (s, t, n)$ is the…

cs.CL2023

Unsupervised Bias Detection in College Student Newspapers

Adam M. Lehavi, William McCormack, Noah Kornfeld +1

This paper presents a pipeline with minimal human influence for scraping and detecting bias on college newspaper archives. This paper introduces a framework for scraping complex ar…

cs.LG2023

RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching

Steve Vott, Adam M. Lehavi

The Ramsey number is the minimum number of nodes, $n = R (s, t)$ , such that all undirected simple graphs of order $n$ , contain a clique of order $s$ , or an independent set of order…

Ramsey Number Counterexample Checking and One Vertex Extension Linearly Bound by s and t

Unsupervised Bias Detection in College Student Newspapers

RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching

Ramsey Number Counterexample Checking and One Vertex Extension Linearly Bound by $s$ and $t$