Cover Image

Separations of sets

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bowler, Nathan, Kneip, Jay Lilian
Format:	Preprint
Published:	2018
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Profinite tree sets
by: Kneip, Jay Lilian
Published: (2019)

Ends as tangles
by: Kneip, Jay Lilian
Published: (2019)

The Structure of Submodular Separation Systems
by: Elbracht, Christian, et al.
Published: (2021)

Representations of infinite tree-sets
by: Gollin, J. Pascal, et al.
Published: (2019)

Tangles are Decided by Weighted Vertex Sets
by: Elbracht, Christian, et al.
Published: (2018)

A Note on Generic Tangle Algorithms
by: Elbracht, Christian, et al.
Published: (2020)

A canonical tree-of-tangles theorem for structurally submodular separation systems
by: Elbracht, Christian, et al.
Published: (2020)

Agile Sets in Graphs
by: Elbracht, Christian, et al.
Published: (2021)

Profinite separation systems
by: Diestel, Reinhard, et al.
Published: (2018)

Obtaining trees of tangles from tangle-tree duality
by: Elbracht, Christian, et al.
Published: (2020)

The Unravelling Problem
by: Elbracht, Christian, et al.
Published: (2021)

Circuit-partition of infinite matroids
by: Bowler, Nathan, et al.
Published: (2024)

$\mathcal{R}(K_{\aleph_0}, \hat{K}_{2,3})$ is a win for Player 1
by: Bowler, Nathan, et al.
Published: (2025)

Trees of tangles in abstract separation systems
by: Elbracht, Christian, et al.
Published: (2019)

Trees of tangles in infinite separation systems
by: Elbracht, Christian, et al.
Published: (2020)

Describing Quasi-Graphic Matroids
by: Bowler, Nathan, et al.
Published: (2018)

A note on uncountably chromatic graphs
by: Bowler, Nathan, et al.
Published: (2024)

Connectoids II: existence of normal trees
by: Bowler, Nathan, et al.
Published: (2024)

Connectoids I: a universal end space theory
by: Bowler, Nathan, et al.
Published: (2024)

The Rational Number Game
by: Bowler, Nathan, et al.
Published: (2023)

A structure theorem for rooted connectivity in bidirected graphs
by: Abrishami, Tara, et al.
Published: (2025)

Locally interval graphs are circular-arc graphs
by: Abrishami, Tara, et al.
Published: (2025)

On the Possibilities of Defining Infinite Oriented Matroids
by: Bowler, Nathan, et al.
Published: (2026)

A note on the alternating number of independent sets in a graph
by: Cutler, Jonathan, et al.
Published: (2024)

Hitting cycles through prescribed vertices or edges
by: Bowler, Nathan, et al.
Published: (2024)

The enumeration of inversion sequences avoiding the patterns 201 and 210
by: Pantone, Jay
Published: (2023)

Rainbow Separating Path Systems
by: Clifton, Alexander, et al.
Published: (2026)

On the number of minimum dominating sets and total dominating sets in forests
by: Petr, Jan, et al.
Published: (2022)

General position sets, colinear sets, and Sierpiński product graphs
by: Klavžar, Sandi, et al.
Published: (2024)

Coarse Balanced Separators and Tree-Decompositions
by: Chudnovsky, Maria, et al.
Published: (2025)

Noncrossing arc diagrams and canonical join representations
by: Reading, Nathan
Published: (2014)

Noncrossing partitions of a marked surface
by: Reading, Nathan
Published: (2022)

Conditions of positivity on a shadow Markoff Tree
by: Bonin, Nathan
Published: (2024)

Enumerating planar stuffed maps as hypertrees of mobiles
by: Pagliaroli, Nathan
Published: (2025)

New Bounds for Induced Turán Problems
by: Sheffield, Nathan S.
Published: (2025)

A note on strong blocking sets and higgledy-piggledy sets of lines
by: Lia, Stefano, et al.
Published: (2024)

Sumsets of random sets
by: Nenadov, Rajko, et al.
Published: (2026)

Separating paths systems of almost linear size
by: Letzter, Shoham
Published: (2022)

Separable overpartition classes and excludant sizes of an overpartition
by: Chen, Y. H., et al.
Published: (2025)

Orientation of alcoves in affine Weyl groups
by: Chapelier-Laget, Nathan
Published: (2022)