1 citations · 2 across the 9 of their papers we have counts for
10 papers
Ramsey properties of maximal (outer)planar graphs
Adriana Baldacchino, Yair Caro, Xandru Mifsud
We study a natural extension of Ramsey theory relative to the classes of maximally planar and maximally outerplanar graphs. This can be seen as a continuation of the study of `Plan…
Fast Mixing for Low-Temperature Potts Models via Poisson Trees
Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg +3
The -state ferromagnetic Potts model on a graph is a probability distribution on all -colourings of that favours many monochromatic edges. Approximate sampling from t…
Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
Andreas Galanis, Leslie Ann Goldberg, Xandru Mifsud
We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recen…
On zero-sum Ramsey numbers modulo 3
Yair Caro, Xandru Mifsud
We start with a systematic study of the zero-sum Ramsey numbers. For a graph with edges, the zero-sum Ramsey number is defined as the smallest positive i…
On -constant, planar and circulant graphs
Yair Caro, Xandru Mifsud
This paper concerns -constant graphs, which are -regular graphs in which the subgraph induced by the open neighbourhood of every vertex has precisely edges. The famil…
Flip colouring of graphs II
Xandru Mifsud
We give results concerning two problems on the recently introduced \textit{flip colourings of graphs}. For positive integers with , we say that a regular grap…
Flip colouring of graphs
Yair Caro, Josef Lauri, Xandru Mifsud +2
It is proved that for integers such that , there exists a red/blue edge-colored graph such that the red degree of every vertex is ,…
A lower-bound for the number of conjugacy classes of
Xandru Mifsud
We establish a sharp lower-bound for the number of conjugacy classes in the alternating group , for . Namely, we show that $k\left(A_n\right) \geq \frac{k\l…
-Core Distance Partitions
Xandru Mifsud
The -core vertices of a graph correspond to the non-zero entries of some eigenvector of for a universal adjacency matrix of the graph. We define a partition of…
Nullspace Vertex Partition in Graphs
Irene Sciriha, Xandru Mifsud, James Borg
The core vertex set of a graph is an invariant of the graph. It consists of those vertices associated with the non-zero entries of the nullspace vectors of a -adjacency ma…