Matthew Wales

activity

20192021

most citedDistribution of colors in Gallai colorings

7 citations · 13 across the 6 of their papers we have counts for

collaborators

6 papers

math.CO2021

The extremal function for structured sparse minors

Matthew Wales

Let $c (H)$ be the smallest value for which $e (G) /∣ G ∣ \geq c (H)$ implies $H$ is a minor of $G$ . We show a new upper bound on $c (H)$ , which improves previous bounds for graphs with a…

math.CO2021

Bipartite clique minors in graphs of large Hadwiger number

Matthew Wales

The Hadwiger number $h (G)$ is the order of the largest complete minor in $G$ . Does sufficient Hadwiger number imply a minor with additional properties? In [2], Geelen et al showed…

math.CO2021

Graphs of low average degree without independent transversals

Carla Groenland, Tomáš Kaiser, Oscar Treffers +1

An independent transversal of a graph $G$ with a vertex partition $P$ is an independent set of $G$ intersecting each block of $P$ in a single vertex. Wanless and…

cs.LG2020

The Role of Isomorphism Classes in Multi-Relational Datasets

Vijja Wichitwechkarn, Ben Day, Cristian Bodnar +2

Multi-interaction systems abound in nature, from colloidal suspensions to gene regulatory circuits. These systems can produce complex dynamics and graph neural networks have been p…

math.CO2019★ 6 cited

On the extremal function for graph minors

Andrew Thomason, Matthew Wales

For a graph $H$ , let $c(H)=\inf\{c\,:\,e(G)\geq c|G| \mbox{ implies } G\succ H\,\}$, where $G ≻ H$ means that $H$ is a minor of $G$ . We show that if $H$ has average degree $d$ ,…

math.CO2019★ 7 cited

Distribution of colors in Gallai colorings

András Gyárfás, Dömötör Pálvölgyi, Balázs Patkós +1

A Gallai coloring is an edge coloring that avoids triangles colored with three different colors. Given integers $e_{1} \geq e_{2} \geq \dots \geq e_{k}$ with $\sum_{i = 1}^{k} e_{i} = (2 n)$ …