4 citations · 4 across the 2 of their papers we have counts for
2 papers
math.CO2021
On the Rank, Kernel, and Core of Sparse Random Graphs
Patrick DeMichele, Margalit Glasgow, Alexander Moreira
We study the rank of the adjacency matrix of a random Erdos Renyi graph . It is well known that when , with high probability, …
math.CO2019★ 4 cited
On the subgraph query problem
Ryan Alweiss, Chady Ben Hamida, Xiaoyu He +1
Given a fixed graph , a real number , and an infinite Erdős-Rényi graph , how many adjacency queries do we have to make to find a copy of insid…