Zobrazeno 1 - 10
of 685
pro vyhledávání: '"Wollan, P."'
Diestel, Hundertmark and Lemanczyk asked whether every $k$-tangle in a graph is induced by a set of vertices by majority vote. We reduce their question to graphs whose size is bounded by a function in $k$. Additionally, we show that if for any fixed
Externí odkaz:
http://arxiv.org/abs/2411.13656
We prove that there is a function $f$ such that every graph with no $K$-fat $K_4$ minor is $f(K)$-quasi-isometric to a graph with no $K_4$ minor. This solves the $K_4$-case of a general conjecture of Georgakopoulos and Papasoglu. Our proof technique
Externí odkaz:
http://arxiv.org/abs/2408.15335
Autor:
Albrechtsen, Sandra, Diestel, Reinhard, Elm, Ann-Kathrin, Fluck, Eva, Jacobs, Raphael W., Knappe, Paul, Wollan, Paul
Given an arbitrary class $\mathcal{H}$ of graphs, we investigate which graphs admit a decomposition modelled on a graph in $\mathcal{H}$ into parts of small radius. The $\mathcal{H}$-decompositions that we consider here generalise the notion of tree-
Externí odkaz:
http://arxiv.org/abs/2307.08497
Publikováno v:
SIAM Journal on Discrete Mathematics Volume 38 Issue 2 (June 2024), Pages: 1438 - 1450
We give an approximate Menger-type theorem for when a graph $G$ contains two $X-Y$ paths $P_1$ and $P_2$ such that $P_1 \cup P_2$ is an induced subgraph of $G$. More generally, we prove that there exists a function $f(d) \in O(d)$, such that for ever
Externí odkaz:
http://arxiv.org/abs/2305.04721
Publikováno v:
BMC Gastroenterology, Vol 24, Iss 1, Pp 1-10 (2024)
Abstract Introduction The incidence of esophageal cancers is increasing in many Western countries and the rate of missed esophageal cancers (MEC) at upper endoscopy is of concern. We aimed to calculate the MEC rate and identify factors associated wit
Externí odkaz:
https://doaj.org/article/212b5f5352c247868a4cf1748d9671b2
We show that a graph contains a large wall as a strong immersion minor if and only if the graph does not admit a tree-cut decomposition of small `width', which is measured in terms of its adhesion and the path-likeness of its torsos.
Comment: 15
Comment: 15
Externí odkaz:
http://arxiv.org/abs/2301.05134
A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching consequence
Externí odkaz:
http://arxiv.org/abs/2010.12397
Publikováno v:
Combinatorica, 42:405--432, 2022
A ladder is a $2 \times k$ grid graph. When does a graph class $\mathcal{C}$ exclude some ladder as a minor? We show that this is the case if and only if all graphs $G$ in $\mathcal{C}$ admit a proper vertex coloring with a bounded number of colors s
Externí odkaz:
http://arxiv.org/abs/2002.00496
Publikováno v:
Foods, Vol 13, Iss 12, p 1850 (2024)
Clarification and stabilisation processes are routinely performed post-fermentation to ‘finish’ wines, but traditional methods are slow and energy intensive, create waste, and can affect wine volume and quality. New methods that ‘finish’ wine
Externí odkaz:
https://doaj.org/article/05fa34becb094d8998eed9ec0720968c
Publikováno v:
J. Combin. Theory Ser. B, 149:76-91, July 2021
Shrub-depth and rank-depth are dense analogues of the tree-depth of a graph. It is well known that a graph has large tree-depth if and only if it has a long path as a subgraph. We prove an analogous statement for shrub-depth and rank-depth, which was
Externí odkaz:
http://arxiv.org/abs/1911.00230