7 citations · 17 across the 10 of their papers we have counts for
10 papers
Distance Exceptional Graphs and the Curvature Index
Sawyer Jack Robertson, Finn Southerland, Erlang Surya
A graph on vertices is said to be \emph{distance exceptional} if the equation admits no solution , where $D\in\mathbb{R…
Lagrange Inversion Formula by Induction
Erlang Surya, Lutz Warnke
We present a simple inductive proof of the Lagrange Inversion Formula.
Isomorphisms between dense random graphs
Erlang Surya, Lutz Warnke, Emily Zhu
We consider two variants of the induced subgraph isomorphism problem for two independent binomial random graphs with constant edge-probabilities p_1,p_2. In particular, (i) we prov…
Counting Deranged Matchings
Sam Spiro, Erlang Surya
Let denote the number of perfect matchings of a graph , and let denote the complete -partite graph where each part has size . Johnso…
The degree-restricted random process is far from uniform
Michael Molloy, Erlang Surya, Lutz Warnke
The degree-restricted random process is a natural algorithmic model for generating graphs with degree sequence D_n=(d_1, \ldots, d_n): starting with an empty n-vertex graph, it seq…
On asymptotic packing of convex geometric and ordered graphs
Jiaxi Nie, Erlang Surya, Ji Zeng
A convex geometric graph is said to be packable if there exist edge-disjoint copies of in the complete convex geometric graph covering all but edges. We prov…
Semi-restricted Rock, Paper, Scissors
Sam Spiro, Erlang Surya, Ji Zeng
Consider the following variant of Rock, Paper, Scissors (RPS) played by two players Rei and Norman. The game consists of rounds of RPS, with the twist being that Rei (the rest…
Sharp Thresholds in Adaptive Random Graph Processes
Calum MacRury, Erlang Surya
The -process is a single player game in which the player is initially presented the empty graph on vertices. In each step, a subset of edges is independently s…
On the concentration of the chromatic number of random graphs
Erlang Surya, Lutz Warnke
Shamir and Spencer proved in the 1980s that the chromatic number of the binomial random graph G(n,p) is concentrated in an interval of length at most ω\sqrt{n}, and in the 1990s Al…
On the concentration of the chromatic number of random graphs
Alex Scott
Let 0<p<1 be fixed. Shamir and Spencer proved in the 1980s that the chromatic number of a random graph in G(n,p) is concentrated in an interval of length about n^{1/2}. In this exp…