Calum Buchanan

activity

20212026

most citedA lower bound on the saturation number and a strengthening for triangle-free graphs

1 citations · 1 across the 9 of their papers we have counts for

collaborators

Showing 2022 · math.COShow all

3 papers · 2 filters

math.CO2022

On the Last New Vertex Visited by a Random Walk in a Directed Graph

Calum Buchanan, Paul Horn, Puck Rombach

Consider a simple graph in which a random walk begins at a given vertex. It moves at each step with equal probability to any neighbor of its current vertex, and ends when it has vi…

math.CO2022

Toughness of recursively partitionable graphs

Calum Buchanan, Brandon Du Preez, K. E. Perry +1

A simple graph $G = (V, E)$ on $n$ vertices is said to be recursively partitionable (RP) if $G ≃ K_{1}$ , or if $G$ is connected and satisfies the following recursive property: for…

math.CO2022

Odd Covers of Graphs

Calum Buchanan, Alexander Clifton, Eric Culver +4

Given a finite simple graph $G$ , an odd cover of $G$ is a collection of complete bipartite graphs, or bicliques, in which each edge of $G$ appears in an odd number of bicliques and…