Showing math.COShow all
4 papers · 1 filter
math.CO2025
Multiset Metric Dimension of Binomial Random Graphs
Austin Eide, Pawel Pralat
For a graph and a subset , we say that is \textit{multiset resolving} for if for every pair of vertices , the \textit{multisets} $\{d(v,r):…
math.CO2025
Playing Sudoku on random 3-regular graphs
Jack Dippel, Austin Eide, Pawel Pralat +1
The Sudoku number of graph with chromatic number is the smallest partial -colouring of that determines a unique -colouring of the entire graph. We…
math.CO2024
Burning Random Trees
Luc Devroye, Austin Eide, Pawel Pralat
Let be a Galton-Watson tree with a given offspring distribution , where is a -valued random variable with and $0 < σ^{2}:=Var[ξ] < \inft…
math.CO2023
Linear Colouring of Binomial Random Graphs
Austin Eide, Paweł Prałat
We investigate the linear chromatic number of the binomial random graph on vertices in which each edge appears independently with probability…