H. Guggiari

activity

20162019

most citedMonochromatic Paths in the Complete Symmetric Infinite Digraph

2 citations · 5 across the 4 of their papers we have counts for

collaborators

6 papers

math.CO2019★ 1 cited

Monochromatic Components in Edge-Coloured Graphs with Large Minimum Degree

Hannah Guggiari, Alex Scott

For every $n \in N$ and $k \geq 2$ , it is known that every $k$ -edge-colouring of the complete graph on $n$ vertices contains a monochromatic connected component of order at le…

math.CO2018

Size reconstructibility of graphs

Carla Groenland, Hannah Guggiari, Alex Scott

The deck of a graph $G$ is given by the multiset of (unlabelled) subgraphs ${G - v : v \in V (G)}$ . The subgraphs $G - v$ are referred to as the cards of $G$ . Brown and Fenner recently s…

math.CO2018

Approximating the position of a hidden agent in a graph

Hannah Guggiari, Alexander Roberts, Alex Scott

A cat and mouse play a pursuit and evasion game on a connected graph $G$ with $n$ vertices. The mouse moves to vertices $m_{1}, m_{2}, \dots$ of $G$ where $m_{i}$ is in the closed neighbou…

math.CO2018

Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs

Carl Bürger, Louis DeBiasio, Hannah Guggiari +1

Let $K_{N}$ be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a $2$ -colouring of the edges of $K_{\ma…

math.CO2017★ 2 cited

Monochromatic Paths in the Complete Symmetric Infinite Digraph

Hannah Guggiari

Let $K_{N}$ be the complete symmetric digraph on the positive integers. Answering a question of DeBiasio and McKenney, we construct a 2-colouring of the edges of $\v…

math.CO2016★ 2 cited

Maximising $H$ -Colourings of Graphs

Hannah Guggiari, Alex Scott

For graphs $G$ and $H$ , an $H$ -colouring of $G$ is a map $ψ : V (G) \to V (H)$ such that $ij \in E (G) \Rightarrow ψ (i) ψ (j) \in E (H)$ . The number of $H$ -colourings of $G$ is denoted…

Monochromatic Components in Edge-Coloured Graphs with Large Minimum Degree

Size reconstructibility of graphs

Approximating the position of a hidden agent in a graph

Partitioning Edge-Coloured Complete Symmetric Digraphs into Monochromatic Complete Subgraphs

Monochromatic Paths in the Complete Symmetric Infinite Digraph

Maximising H-Colourings of Graphs

Maximising $H$ -Colourings of Graphs