Imagen de Portada

How many times can two minimum spanning trees cross?

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Antić, Todor, Saghafian, Morteza, Saumell, Maria, Schröder, Felix, Tkadlec, Josef, Valtr, Pavel
Formato:	Preprint
Publicado:	2026
Materias:	Computational Geometry Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

Minimum spanning blob-trees
por: Klost, Katharina, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Disjoint Compatibility via Graph Classes
por: Aichholzer, Oswin, et al.
Publicado: (2024)

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

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

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

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

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

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

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