REVIEW 1 cited by
Tangles are Decided by Weighted Vertex Sets
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We show that, given a $ k $-tangle $ \tau $ in a graph $ G $, there always exists a weight function $ w\colon V(G)\to\mathbb{N} $ such that a separation $ (A,B) $ of $ G $ of order $ {<}k $ lies in $ \tau $ if and only if $ w(A)<w(B) $, where $ w(U) := \sum_{u\in U}w(u) $ for $ U\subseteq V(G) $. We show that the same result holds also for tangles of hypergraphs as well as for edge-tangles of graphs, but not for edge-tangles of hypergraphs.
Forward citations
Cited by 1 Pith paper
-
On vertex sets inducing tangles
Every k-tangle in a graph is the lift of a k-tangle in a topological minor of size bounded by a function of k, reducing the vertex-set induction problem to bounded-size graphs.
Discussion (0). Continue with ORCID to comment.