research
∙
07/22/2023
Multigraph edge-coloring with local list sizes
Let G be a multigraph and L : E(G) → 2^ℕ be a list assignment on the edg...
share
research
∙
07/13/2023
Edge-Coloring Algorithms for Bounded Degree Multigraphs
In this paper, we consider algorithms for edge-coloring multigraphs G of...
research
∙
06/30/2023
Borel Vizing's Theorem for Graphs of Subexponential Growth
We show that every Borel graph G of subexponential growth has a Borel pr...
research
∙
04/17/2023
Detection of Dense Subhypergraphs by Low-Degree Polynomials
Detection of a planted dense subgraph in a random graph is a fundamental...
research
∙
03/09/2023
Fast algorithms for Vizing's theorem on bounded degree graphs
Vizing's theorem states that every graph G of maximum degree Δ can be pr...
research
∙
02/20/2023
Sharp analysis of EM for learning mixtures of pairwise differences
We consider a symmetric mixture of linear regressions with random sample...
research
∙
07/12/2021