1 citations · 3 across the 14 of their papers we have counts for
5 papers · 1 filter
Proof of Nash-Williams' Intersection Conjecture for countable matroids
Attila Joó
We prove that if and are finitary matroids on a common countable edge set then they admit a common independent set such that there is a bipartition $ E=E_{M}…
Reducing the dichromatic number via cycle reversions in infinite digraphs
Paul Ellis, Attila Joó, Dániel T. Soukup
We prove the following conjecture of S. Thomassé: for every (potentially infinite) digraph it is possible to iteratively reverse directed cycles in such a way that the dichro…
On the growth rate of dichromatic numbers of finite subdigraphs
Attila Joó
Chris Lambie-Hanson proved recently that for every function there is an -chromatic graph of size such that…
Uncountable dichromatic number without short directed cycles
Attila Joó
A. Hajnal and P. Erdős proved that a graph with uncountable chromatic number cannot avoid short cycles, it must contain for example (among other obligatory subgraphs). It w…
The Complete Lattice of Erdős-Menger Separations
Attila Joó
F. Escalante and T. Gallai studied in the seventies the structure of different kind of separations and cuts between a vertex pair in a (possibly infinite) graph. One of their resul…