A. Joó

most citedEdmonds' Branching Theorem in Digraphs without Forward-infinite Paths

3 citations · 7 across the 5 of their papers we have counts for

collaborators

7 papers

math.CO2019★ 1 cited

Base partition for mixed families of finitary and cofinitary matroids

Joshua Erde, Pascal Gollin, Attila Joó +2

Let $M = (M_{i} : i \in K)$ be a finite or infinite family consisting of matroids on a common ground set $E$ each of which may be finitary or cofinitary. We prove the…

math.CO2019★ 2 cited

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs

Joshua Erde, Pascal Gollin, Atilla Joó +2

We show that if a graph admits a packing and a covering both consisting of $λ$ many spanning trees, where $λ$ is some infinite cardinal, then the graph also admits a decomposition…

math.CO2017

King-serf duo by monochromatic paths in k-edge-coloured tournaments

Kristóf Bérczi, Attila Joó

An open conjecture of Erdős states that for every positive integer $k$ there is a (least) positive integer $f (k)$ so that whenever a tournament has its edges colored with $k$ color…

math.CO2017★ 1 cited

Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair

Attila Joó

We construct for all $k \in N$ a $k$ -edge-connected digraph $D$ with $s, t \in V (D)$ such that there are no edge-disjoint $s \to t$ and $t \to s$ pa…

math.CO2017★ 3 cited

Edmonds' Branching Theorem in Digraphs without Forward-infinite Paths

Attila Joó

Let $D$ be a finite digraph, and let $V_{0}, \dots, V_{k - 1}$ be nonempty subsets of $V (D)$ . The (strong form of) Edmonds' branching theorem states thatthere are pairwise edge-dis…

math.CO2017

Countable Menger theorem with finitary matroid constraints on the ingoing edges

Attila Joó

We present a strengthening of the countable Menger theorem (edge version) of R. Aharoni. Let $D = (V, A)$ be a countable digraph with $s \neq = t \in V$ and let $\mathcal{M}=\bigoplus…

math.CO2017

Gomory-Hu trees of infinite graphs with finite total weight

Attila Joó

Gomory and Hu proved that if $G$ is a finite graph with non-negative weights on its edges, then there exists a tree $T$ (called now Gomory-Hu tree) on $V (G)$ such that for al…