1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.CO2005
A special case of Hadwiger's conjecture
Jonah Blasiak
We investigate Hadwiger's conjecture for graphs with no stable set of size 3. Such a graph on at least 2t-1 vertices is not t-1 colorable, so is conjectured to have a minor.…
math.PR2004★ 1 cited
Longest common subsequences and the Bernoulli matching model: numerical work and analyses of the r-reach simplification
Jonah Blasiak
The expected length of longest common subsequences is a problem that has been in the literature for at least twenty five years. Determining the limiting constants γ_k appears to be…
math.PR2004
Random Oxford Graphs
Jonah Blasiak, Rick Durrett
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with left vertices, n right verti…