Zobrazeno 1 - 10 of 23 pro vyhledávání: '"ATTILA JOÓ"'
1
Akademický článek
The Lovász–Cherkassky theorem in infinite graphs
Autor: Attila Joó
Publikováno v: Transactions of the London Mathematical Society, Vol 11, Iss 1, Pp n/a-n/a (2024)
Abstract Infinite generalizations of theorems in finite combinatorics were initiated by Erdős due to his famous Erdős–Menger conjecture (now known as the Aharoni–Berger theorem) that extends Menger's theorem to infinite graphs in a structural w
Externí odkaz: https://doaj.org/article/fa6484b5ce674854a159d10e1c39c3e1
Zobrazit plný text záznamu
5
MAKER–BREAKER GAMES ON AND
Autor: NATHAN BOWLER, FLORIAN GUT, ATTILA JOÓ, MAX PITZ
Publikováno v: The Journal of Symbolic Logic. 88:697-703
We investigate Maker–Breaker games on graphs of size $\aleph _1$ in which Maker’s goal is to build a copy of the host graph. We establish a firm dependence of the outcome of the game on the axiomatic framework. Relating to this, we prove that the
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::b13e4f2806926688797e616c48fb2109
https://doi.org/10.1017/jsl.2022.49
Zobrazit plný text záznamu
7
Greedoids from flames
Autor: Attila Joó
Publikováno v: Journal of Graph Theory. 98:49-56
A digraph $ D $ with $ r\in V(D) $ is an $ r $-flame if for every $ {v\in V(D)-r} $, the in-degree of $ v $ is equal to the local edge-connectivity $ \lambda_D(r,v) $. We show that for every digraph $ D $ and $ r\in V(D) $, the edge sets of the $ r $
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::88cf84b240ffd39dd2d5b85d49d572ef
https://doi.org/10.1002/jgt.22681
Zobrazit plný text záznamu
8
Base Partition for Mixed Families of Finitary and Cofinitary Matroids
Autor: Joshua Erde, Paul Knappe, Max Pitz, Attila Joó, J. Pascal Gollin
Publikováno v: Combinatorica. 41:31-52
Let $$\mathcal{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 following Cantor-Bernstein-type result: If there is a collection of bases,
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b797b697679cfaae048c8e724feafe52
https://doi.org/10.1007/s00493-020-4422-4
Zobrazit plný text záznamu
9
Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex
Autor: Attila Joó
Publikováno v: Combinatorica. 39:1317-1333
It follows from a theorem of Lovasz that if D is a finite digraph with r ∈ V(D), then there is a spanning subdigraph E of D such that for every vertex v ≠ r the following quantities are equal: the local connectivity from r to v in D, the local co
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::65b9a0e3c1d53cf90e1bb2bdb3677b5d
https://doi.org/10.1007/s00493-019-3880-z
Zobrazit plný text záznamu
10
Uncountable dichromatic number without short directed cycles
Autor: Attila Joó
Publikováno v: Journal of Graph Theory. 94:113-116
A. Hajnal and P. Erd\H{o}s proved that a graph with uncountable chromatic number cannot avoid short cycles, it must contain for example $ C_4 $ (among other obligatory subgraphs). It was shown recently by D. T. Soukup that, in contrast of the undirec
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::14e902a36bf7d64f217d43831a8e28cb
https://doi.org/10.1002/jgt.22509
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje