1 citations · 3 across the 6 of their papers we have counts for
5 papers · 1 filter
Coloring Chains for Compression with Uncertain Priors
Noah Golowich
Haramaty and Sudan considered the problem of transmitting a message between two people, Alice and Bob, when Alice's and Bob's priors on the message are allowed to differ by at most…
The m-Degenerate Chromatic Number of a Digraph
Noah Golowich
The digraph chromatic number of a directed graph , denoted , is the minimum positive integer such that there exists a partition of the vertices of into disjo…
Acyclic Subgraphs of Planar Digraphs
Noah Golowich, David Rolnick
An acyclic set in a digraph is a set of vertices that induces an acyclic subgraph. In 2011, Harutyunyan conjectured that every planar digraph on vertices without directed 2-cyc…
Resolving a Conjecture on Degree of Regularity of Linear Homogeneous Equations
Noah Golowich
A linear equation is -regular, if, for every -coloring of the positive integers, there exist positive integers of the same color which satisfy the equation. In 2005, Fox and…
Degree of Regularity of Linear Homogeneous Equations
Kavish Gandhi, Noah Golowich, László Miklós Lovász
We define a linear homogeneous equation to be strongly r-regular if, when a finite number of inequalities is added to the equation, the system of the equation and inequalities is s…