A. Jo'o

activity

20242026

collaborators

Showing math.COShow all

7 papers · 1 filter

math.CO2026

Well-order a flame

Zsuzsanna JankÃ³, Attila JoÃ³

An $r$ -rooted (possibly infinite) digraph $D = (V, E)$ is a flame if for every $v \in V ∖ {r}$ there exists a set of edge-disjoint paths from $r$ to $v$ in $D$ that cove…

math.CO2025

A structure theorem for rooted connectivity in bidirected graphs

Tara Abrishami, Nathan Bowler, Attila JoÃ³ +2

Recently, bidirected graphs have received increasing attention from the graph theory community with both structural and algorithmic results. Bidirected graphs are a generalization…

math.CO2025

Large flames in rooted acyclic digraphs without backward-infinite paths

Attila JoÃ³, Qiuzhenyu Tao

An $r$ -rooted digraph is a flame if for each non-root vertex $v$ , there is a set of edge-disjoint directed paths from $r$ to $v$ that covers all ingoing edges of $v$ . The study of…

math.CO2025

Circuit-partition of infinite matroids

Nathan Bowler, Attila JoÃ³

KomjÃ¡th, Milner, and Polat investigated when a finitary matroid admits a partition into circuits. They defined the class of ``finite matching extendable'' matroids and showed in t…

math.CO2025

Wild generalised truncation of infinite matroids

J. Pascal Gollin, Attila JoÃ³

For $n \in N$ , the $n$ -truncation of a matroid $M$ of rank at least $n$ is the matroid whose bases are the $n$ -element independent sets of $M$ . One can extend this defin…

math.CO2025

Hindrance from a wasteful common independent set

Attila JoÃ³

For (potentially infinite) matroids $M$ and $N$ , an $(M, N)$ -hindrance is a set $H$ that is independent but not spanning in $N . span_{M} (H)$ . This concept was introdu…