Cover Image

How many times can two minimum spanning trees cross?

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Antić, Todor, Saghafian, Morteza, Saumell, Maria, Schröder, Felix, Tkadlec, Josef, Valtr, Pavel
Format:	Preprint
Published:	2026
Subjects:	Computational Geometry Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Hypercube drawings with no long plane paths
by: Antić, Todor, et al.
Published: (2026)

Crossing and non-crossing families
by: Antić, Todor, et al.
Published: (2025)

Edge-Constrained Hamiltonian Paths on a Point Set
by: Antić, Todor, et al.
Published: (2025)

On Spheres with $k$ Points Inside
by: Edelsbrunner, Herbert, et al.
Published: (2024)

Lattice and Non-lattice Piercing of Axis-Parallel Rectangles
by: Dumitrescu, Adrian, et al.
Published: (2022)

Two Results on Outer-String Graphs
by: Antić, Todor, et al.
Published: (2026)

Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
by: Draganov, Ondřej, et al.
Published: (2025)

Minimum spanning blob-trees
by: Klost, Katharina, et al.
Published: (2025)

On Angles in Higher Order Brillouin Tessellations and Related Tilings in the Plane
by: Edelsbrunner, Herbert, et al.
Published: (2022)

Rapid mixing of the flip chain over non-crossing spanning trees
by: Anand, Konrad, et al.
Published: (2024)

Bounding and computing obstacle numbers of graphs
by: Balko, Martin, et al.
Published: (2022)

Order-2 Delaunay Triangulations Optimize Angles
by: Edelsbrunner, Herbert, et al.
Published: (2023)

Computing largest minimum color-spanning intervals of imprecise points
by: Acharyya, Ankush, et al.
Published: (2024)

Star-Forest Decompositions of Complete Graphs
by: Antić, Todor, et al.
Published: (2024)

Reconfigurations of Plane Caterpillars and Paths
by: Antić, Todor, et al.
Published: (2024)

Flips in Two-dimensional Hypertriangulations
by: Edelsbrunner, Herbert, et al.
Published: (2022)

The Euclidean MST-ratio for Bi-colored Lattices
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2024)

Brillouin Zones of Integer Lattices and Their Perturbations
by: Edelsbrunner, Herbert, et al.
Published: (2022)

Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations
by: Alegría-Galicia, Carlos, et al.
Published: (2017)

Unbent Collections of Orthogonal Drawings
by: Antić, Todor, et al.
Published: (2025)

Degenerate crossing number and signed reversal distance
by: Fuladi, Niloufar, et al.
Published: (2023)

The maximum number of digons formed by pairwise crossing pseudocircles
by: Ackerman, Eyal, et al.
Published: (2024)

Sublevels in arrangements and the spherical arc crossing number of complete graphs
by: Streltsova, Elizaveta, et al.
Published: (2025)

Equivariant cohomology of Grassmannian spanning lines
by: Chou, Raymond, et al.
Published: (2024)

A canonical tree decomposition for order types, and some applications
by: Bouvel, Mathilde, et al.
Published: (2024)

On the rectilinear crossing number of complete balanced multipartite graphs and layered graphs
by: Fabila-Monroy, Ruy, et al.
Published: (2024)

Strongly chordal graphs as intersection graphs of trees (Farber's proof revisited)
by: Biedl, Therese
Published: (2025)

Steiner trees with infinitely many terminals on the sides of an angle
by: Cherkashin, Danila, et al.
Published: (2024)

On the random minimum edge-disjoint spanning trees problem
by: Shabanov, Dmitry, et al.
Published: (2025)

The number of regular simplices in higher dimensions
by: Clemen, Felix Christian, et al.
Published: (2025)

Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)

Three Edge-disjoint Plane Spanning Paths in a Point Set
by: Kindermann, Philipp, et al.
Published: (2023)

Disjoint Compatibility via Graph Classes
by: Aichholzer, Oswin, et al.
Published: (2024)

Subset Selection Problems in Planar Point Sets
by: Balogh, József, et al.
Published: (2024)

Shellability is hard even for balls
by: Paták, Pavel, et al.
Published: (2022)

Stabbing boxes with finitely many axis-parallel lines and flats
by: Chakraborty, Sutanoya, et al.
Published: (2023)

Grid Peeling of Parabolas
by: Rote, Günter, et al.
Published: (2024)

On the geometric $k$-colored crossing number of $K_n$
by: Hahn, Benedikt, et al.
Published: (2025)

On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
by: Ameli, Afrouz Jabal, et al.
Published: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)