Searcharxiv⌕ Search

arXiv subjects

Julian Pott

Publications and source records attributed to Julian Pott.

5 recordsLinked to original sources
arXiv2014

Linkages in Large Graphs of Bounded Tree-Width

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

math.CO↗
arXiv2013

Orthogonality and minimality in the homology of locally finite graphs

Given a finite set $E$, a subset $D\sub E$ (viewed as a function $E\to \F_2$) is orthogonal to a given subspace $\FF$ of the $\F_2$-vector space of functions $E\to \F_2$ as soon as $D$ is orthogonal to every $\sub$-minimal element of $\FF$. This fails in general when $E$ is infinite. However, we prove the above statement for the six subspaces $\FF$ of the edge space of any 3-connected locally finite graph that are relevant to its homology: the topological, algebraic, and finite cycle and cut spaces. This solves a problem of [5]

math.CO↗
arXiv2011

Dual trees must share their ends

We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an infinite setting is that dual trees must share between them not only the edges of their host graphs but also their ends: the statement that a set of edges is acyclic and connects all the vertices in one of the graphs iff the remaining edges do the same in its dual will hold only once each of the two graphs' common ends has been assigned to one graph but not the other, and 'cycle' and 'connected' are interpreted topologically in the space containing the respective edges and precisely the ends thus assigned. This property characterizes graph duality: if, conversely, the spanning trees of two infinite graphs are complementary in this end-sharing way, the graphs form a dual pair.

math.CO↗
arXiv2009

Transitivity conditions in infinite graphs

We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.

math.CO↗