4 citations · 6 across the 4 of their papers we have counts for
5 papers
Coloring locally sparse graphs
James Anderson, Abhishek Dhawan, Aiya Kuchukova
A graph is -locally sparse if for each vertex , the subgraph induced by its neighborhood contains at most edges. Alon, Krivelevich, and Sudakov showed that f…
Borel line graphs
James Anderson, Anton Bernshteyn
We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the 9 finite graphs from the classical result of Beineke together with a 10th infinite graph as…
Coloring graphs with forbidden almost bipartite subgraphs
James Anderson, Anton Bernshteyn, Abhishek Dhawan
Alon, Krivelevich, and Sudakov conjectured in 1999 that for every finite graph , there exists a quantity such that whenever is an $…
Learning Linear Models Using Distributed Iterative Hessian Sketching
Han Wang, James Anderson
This work considers the problem of learning the Markov parameters of a linear system from observed data. Recent non-asymptotic system identification results have characterized the…
Coloring graphs with forbidden bipartite subgraphs
James Anderson, Anton Bernshteyn, Abhishek Dhawan
A conjecture of Alon, Krivelevich, and Sudakov states that, for any graph , there is a constant such that if is an -free graph of maximum degree , then $χ(G)…