51 citations · 243 across the 25 of their papers we have counts for
27 papers
Rainbow Trees in Hypercubes
Nicholas Crawford, Maya Sankar, Carl Schildkraut +1
We prove that every proper edge-coloring of the -dimensional hypercube contains a rainbow copy of every tree on at most edges. This result is best possible, as $Q_…
Random field induced order in two dimensions
Nicolas Crawford, Wioletta M. Ruszel
In this article we prove that a classical model subjected to weak i.i.d. random field pointing in a fixed direction exhibits residual magnetic order in and alig…
Percolation transition for random forests in
Roland Bauerschmidt, Nicholas Crawford, Tyler Helmuth
The arboreal gas is the probability measure on (unrooted spanning) forests of a graph in which each forest is weighted by a factor per edge. It arises as the limit o…
3-colorability of graphs with minimum degree at least 6
Nicholas Crawford, Sogol Jahanbekam
Let be an -vertex graph and let be a list assignment over the vertices of , where each vertex with list of size 3 and of degree at most 5…
Improved algorithm to determine 3-colorability of graphs with the minimum degree at least 7
Nicholas Crawford, Sogol Jahanbekam, Katerina Potika
Let be an -vertex graph with the maximum degree and the minimum degree . We give algorithms with complexity and that…
Macroscopic loops in the loop O(n) model via the XOR trick
Nicholas Crawford, Alexander Glazman, Matan Harel +1
The loop model is a family of probability measures on collections of non-intersecting loops on the hexagonal lattice, parameterized by a loop-weight and an edge-weight $…