16 citations · 81 across the 23 of their papers we have counts for
4 papers · 1 filter
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
Nathan Bowler, Christian Elbracht, Joshua Erde +4
A graph is said to be ubiquitous, if every graph that contains arbitrarily many disjoint -minors automatically contains infinitely many disjoint -minors. The well-kno…
The Game: Vertex Colouring
Nathan Bowler, Marit Emde, Florian Gut
We investigate games played between Maker and Breaker on an infinite complete graph whose vertices are coloured with colours from a given set, each colour appearing infinitely ofte…
Recognising Graphic and Matroidal Connectivity Functions
Nathan Bowler, Susan Jowett
A {\em connectivity function} on a set is a function such that , that for all , and that $λ(X\cap Y)+λ(…
Classification of doubly distributive skew hyperfields and stringent hypergroups
Nathan Bowler, Ting Su
A hypergroup is stringent if is a singleton whenever . A hyperfield is stringent if the underlying additive hypergroup is. Every doubly distributive skew…