Zobrazeno 1 - 10
of 33
pro vyhledávání: '"MAX PITZ"'
Publikováno v:
Israel Journal of Mathematics. 253:617-645
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fe0916a2d02745a4110ef804291a7d33
https://doi.org/10.1007/s11856-022-2368-5
https://doi.org/10.1007/s11856-022-2368-5
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
https://doi.org/10.1017/jsl.2022.49
Autor:
Nathan Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen
Publikováno v:
Bowler, N, Elbracht, C, Erde, J, Gollin, J P, Heuer, K, Pitz, M & Teegen, M 2023, ' Ubiquity of graphs with nowhere-linear end structure ', Journal of Graph Theory, vol. 103, no. 3, pp. 564-598 . https://doi.org/10.1002/jgt.22936
A graph G is said to be ≼‐ubiquitous, where ≼ is the minor relation between graphs, if whenever Γ is a graph with nG≼Γ for all n ∈ N, then one also has ℵ0G≼Γ, where αG is the disjoint union of α many copies of G. A well‐known con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c8775e79a01ed862d347111b49838a9d
https://orbit.dtu.dk/en/publications/d0e9178e-2ca7-42c9-838a-cd6def61275c
https://orbit.dtu.dk/en/publications/d0e9178e-2ca7-42c9-838a-cd6def61275c
Autor:
Max Pitz
Publikováno v:
Israel Journal of Mathematics. 246:353-370
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a89ee01f3b617db0f8d1c10b2b03d4dd
https://doi.org/10.1007/s11856-021-2249-3
https://doi.org/10.1007/s11856-021-2249-3
Publikováno v:
Journal of Combinatorial Theory, Series B. 149:16-22
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 into λ many spanning trees. For finite λ the analogous question remain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e45c87153eda8eb756d21689c7af9797
https://doi.org/10.1016/j.jctb.2021.01.004
https://doi.org/10.1016/j.jctb.2021.01.004
Autor:
Max Pitz
Publikováno v:
Bulletin of the London Mathematical Society. 53:1220-1227
In a paper from 2001 (Journal of the LMS), Diestel and Leader offered a proof that a connected graph has a normal spanning tree if and only if it does not contain a minor from two specific forbidden classes of graphs, all of cardinality $\aleph_1$. U
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13db63b387393c0b32c8eca6159fd43c
https://doi.org/10.1112/blms.12495
https://doi.org/10.1112/blms.12495
Publikováno v:
Journal of Combinatorial Theory, Series B. 148:173-183
We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both combinatorial and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a0747bcf33c2fa3c674426c831eb0c2
https://doi.org/10.1016/j.jctb.2020.12.007
https://doi.org/10.1016/j.jctb.2020.12.007
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
https://doi.org/10.1007/s00493-020-4422-4
Autor:
Max Pitz
Publikováno v:
Journal of Combinatorial Theory, Series B. 145:466-469
We show that a graph $G$ has a normal spanning tree if and only if its vertex set is the union of countably many sets each separated from any subdivided infinite clique in $G$ by a finite set of vertices. This proves a conjecture by Brochet and Diest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::87534ecc56ac54fb4a4f22dd3e41d072
https://doi.org/10.1016/j.jctb.2020.07.002
https://doi.org/10.1016/j.jctb.2020.07.002
Publikováno v:
Journal of Graph Theory. 95:209-239
A compact graph-like space is a triple $(X,V,E)$ where $X$ is a compact, metrizable space, $V \subseteq X$ is a closed zero-dimensional subset, and $E$ is an index set such that $X \setminus V \cong E \times (0,1)$. New characterizations of compact g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::73899da66045feaa1b0c65983bd99c82
https://doi.org/10.1002/jgt.22558
https://doi.org/10.1002/jgt.22558