Nathan Bowler

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The rational number game
The Electronic Journal of Combinatorics
2025-01-27Paper
Bounding the cop number of a graph by its genus
Acta Mathematica Universitatis Comenianae. New Series
2024-10-18Paper
Ubiquity of locally finite graphs with extensive tree-decompositions
Combinatorial Theory
2024-10-08Paper
Corrigendum to: ``Describing quasi-graphic matroids
European Journal of Combinatorics
2024-09-30Paper
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture
Journal of Combinatorial Theory. Series B
2024-01-29Paper
Ubiquity of graphs with nowhere‐linear end structure
Journal of Graph Theory
2023-10-12Paper
Foundations for the Working Mathematician, and for Their Computer
Synthese Library
2023-09-20Paper
The Kℵ0$K^{\aleph _0}$ game: Vertex colouring
Mathematika
2023-09-15Paper
The Rational Number Game
 
2023-09-11Paper
The $K^4$-Game
 
2023-09-05Paper
MAKER–BREAKER GAMES ON AND
Journal of Symbolic Logic
2023-06-05Paper
Menger's Theorem in bidirected graphs
 
2023-06-02Paper
Decomposition of (infinite) digraphs along directed 1-separations
 
2023-05-16Paper
Topological ubiquity of trees
Journal of Combinatorial Theory. Series B
2022-09-23Paper
Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
 
2022-05-03Paper
Bounding the cop number of a graph by its genus
SIAM Journal on Discrete Mathematics
2021-11-04Paper
On the intersection conjecture for infinite trees of matroids
Journal of Combinatorial Theory. Series B
2021-09-16Paper
Classification of doubly distributive skew hyperfields and stringent hypergroups
Journal of Algebra
2021-03-09Paper
Ubiquity in graphs III: Ubiquity of locally finite graphs with extensive tree-decompositions
 
2020-12-23Paper
Recognising graphic and matroidal connectivity functions
Discrete Mathematics
2020-10-08Paper
The almost intersection property for pairs of matroids on common groundset
The Electronic Journal of Combinatorics
2020-07-29Paper
Investigating posets via their maximal chains
Order
2020-07-17Paper
Separations of sets
Order
2020-07-17Paper
The colouring number of infinite graphs
Combinatorica
2020-02-26Paper
Describing quasi-graphic matroids
European Journal of Combinatorics
2020-02-20Paper
Perfect matroids over hyperfields
 
2019-08-09Paper
Peripheral circuits in infinite binary matroids
Journal of Combinatorial Theory. Series B
2018-12-20Paper
Non-reconstructible locally finite graphs
Journal of Combinatorial Theory. Series B
2018-10-11Paper
Ubiquity in graphs II: Ubiquity of graphs with nowhere-linear end structure
 
2018-09-03Paper
Infinite graphic matroids
Combinatorica
2018-07-23Paper
Ubiquity in graphs I: Topological ubiquity of trees
 
2018-06-11Paper
Minimal obstructions for normal spanning trees
Fundamenta Mathematicae
2018-04-10Paper
An excluded minors method for infinite matroids
Journal of Combinatorial Theory. Series B
2017-11-28Paper
Reconstruction of infinite matroids from their 3-connected minors
European Journal of Combinatorics
2017-10-10Paper
A counterexample to the reconstruction conjecture for locally finite trees
Bulletin of the London Mathematical Society
2017-09-13Paper
A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
Discrete Applied Mathematics
2017-07-27Paper
Coproducts of monads on Set
2012 27th Annual IEEE Symposium on Logic in Computer Science
2017-05-16Paper
Matroid intersection, base packing and base covering for infinite matroids
Combinatorica
2016-05-03Paper
Self-dual uniform matroids on infinite sets
Proceedings of the American Mathematical Society
2016-03-02Paper
Matroids over hyperfields
 
2016-01-06Paper
Edge-disjoint double rays in infinite graphs: a Halin type result
Journal of Combinatorial Theory. Series B
2015-03-05Paper
Thin sums matroids and duality
Advances in Mathematics
2015-01-06Paper
Infinite trees of matroids
 
2014-09-23Paper
Matroids with an infinite circuit-cocircuit intersection
Journal of Combinatorial Theory. Series B
2014-08-29Paper
On the intersection conjecture for infinite trees of matroids
 
2014-04-24Paper
The axiom scheme of acyclic comprehension
Notre Dame Journal of Formal Logic
2014-04-04Paper
Exploring the boundaries of monad tensorability on Set
Logical Methods in Computer Science
2013-09-26Paper
The ubiquity of Psi-matroids
 
2013-04-25Paper
Model theoretic connected components of finitely generated nilpotent groups
Journal of Symbolic Logic
2013-04-23Paper
Infinite Matroids and Determinacy of Games
 
2013-01-25Paper
Winning an infinite combination of games
Mathematika
2012-08-22Paper
Normal subgroups of infinite symmetric groups, with an application to stratified set theory
Journal of Symbolic Logic
2009-03-25Paper
A note on uncountably chromatic graphs
 
N/APaper


Research outcomes over time


This page was built for person: Nathan Bowler