Nathan J. Bowler

Affiliations:
  • University of Hamburg, Germany


According to our database1, Nathan J. Bowler authored at least 28 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture.
J. Comb. Theory, Ser. B, January, 2024

2023
Ubiquity of graphs with nowhere-linear end structure.
J. Graph Theory, July, 2023

Maker-Breaker Games on and.
J. Symb. Log., 2023

Decomposition of (infinite) digraphs along directed 1-separations.
CoRR, 2023

2022
Topological ubiquity of trees.
J. Comb. Theory, Ser. B, 2022

2021
Bounding the Cop Number of a Graph by Its Genus.
SIAM J. Discret. Math., 2021

On the intersection conjecture for infinite trees of matroids.
J. Comb. Theory, Ser. B, 2021

2020
Separations of Sets.
Order, 2020

Investigating posets via their maximal chains.
Order, 2020

Describing quasi-graphic matroids.
Eur. J. Comb., 2020

The Almost Intersection Property for Pairs of Matroids on Common Groundset.
Electron. J. Comb., 2020

2019
Peripheral circuits in infinite binary matroids.
J. Comb. Theory, Ser. B, 2019

The Colouring Number of Infinite Graphs.
Comb., 2019

2018
Non-reconstructible locally finite graphs.
J. Comb. Theory, Ser. B, 2018

An excluded minors method for infinite matroids.
J. Comb. Theory, Ser. B, 2018

Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies.
Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics, 2018

Reconstruction of infinite matroids from their 3-connected minors.
Eur. J. Comb., 2018

Infinite Graphic Matroids.
Comb., 2018

2017
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs.
Discret. Appl. Math., 2017

2015
Rudimentary Recursion, Gentle Functions and Provident Sets.
Notre Dame J. Formal Log., 2015

Edge-disjoint double rays in infinite graphs: A Halin type result.
J. Comb. Theory, Ser. B, 2015

Matroid intersection, base packing and base covering for infinite matroids.
Comb., 2015

2014
The Axiom Scheme of Acyclic Comprehension.
Notre Dame J. Formal Log., 2014

Matroids with an infinite circuit-cocircuit intersection.
J. Comb. Theory, Ser. B, 2014

2013
Model theoretic connected components of finitely generated nilpotent groups.
J. Symb. Log., 2013

Exploring the Boundaries of Monad Tensorability on Set.
Log. Methods Comput. Sci., 2013

2012
Coproducts of Monads on Set.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

2009
Normal subgroups of infinite symmetric groups, with an application to stratified set theory.
J. Symb. Log., 2009


  Loading...