Attila Joó

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
The Lovász-Cherkassky theorem in infinite graphs	2025-01-08	Paper
On the packing/covering conjecture of infinite matroids	2024-08-28	Paper
Finite matchability under the matroidal Hall's condition	2024-05-10	Paper
Large vertex-flames in uncountable digraphs	2024-04-16	Paper
The Lov\'asz-Cherkassky theorem in infinite graphs	2023-11-11	Paper
Greedoids from flames	2023-10-04	Paper
The Lovász-Cherkassky theorem for locally finite graphs with ends	2023-10-04	Paper
On generalisations of the Aharoni–Pouzet base exchange theorem	2023-09-15	Paper
MAKER–BREAKER GAMES ON AND	2023-06-05	Paper
Weakly reflecting graph properties	2023-05-30	Paper
A Cantor-Bernstein theorem for infinite matroids	2023-01-11	Paper
The Lovász-Cherkassky theorem in countable graphs	2023-01-04	Paper
Matching variables to equations in infinite linear equation systems	2023-01-04	Paper
Cutting a cake for infinitely many guests	2022-04-04	Paper
On partitioning the edges of an infinite digraph into directed cycles	2021-11-05	Paper
Enlarging vertex-flames in countable digraphs	2021-09-16	Paper
Intersection of a partitional and a general infinite matroid	2021-07-08	Paper
Base partition for mixed families of finitary and cofinitary matroids	2021-06-29	Paper
On the Packing/Covering Conjecture of Infinite Matroids	2021-03-27	Paper
Proof of Nash-Williams' intersection conjecture for countable matroids	2021-02-15	Paper
Reducing the dichromatic number via cycle reversions in infinite digraphs	2021-02-08	Paper
Uncountable dichromatic number without short directed cycles	2020-05-21	Paper
Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex	2020-02-26	Paper
On the growth rate of dichromatic numbers of finite subdigraphs	2020-01-22	Paper
The Complete Lattice of Erd\H{o}s-Menger Separations	2019-04-12	Paper
Countable Menger's theorem with finitary matroid constraints on the ingoing edges	2018-08-15	Paper
Gomory‐Hu trees of infinite graphs with finite total weight	2018-07-13	Paper
Packing countably many branchings with prescribed root-sets in infinite digraphs	2018-02-23	Paper
$T$-joins in infinite graphs	2017-07-26	Paper
Highly connected infinite digraphs without edge-disjoint back and forth paths between a certain vertex pair	2017-06-30	Paper
Independent and maximal branching packing in infinite matroid-rooted digraphs	2017-05-02	Paper
T-joins in infinite graphs as edge-disjoint system of paths matching the vertices in $ T $	2017-04-24	Paper
King-serf duo by monochromatic paths in $k$-edge-coloured tournaments	2017-04-10	Paper
Edmonds' branching theorem in digraphs without forward-infinite paths	2016-11-16	Paper
On Connected Strongly-Proportional Cake-Cutting	N/A	Paper
A Note on Matching Variables to Equations	N/A	Paper

Research outcomes over time

This page was built for person: Attila Joó