Cover Image

On the Extension Theorem for Packing Steiner Forests

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Zeng, Jinghan A
Format:	Preprint
Published:	2026
Subjects:	Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Completely Independent Steiner Trees
by: Maheshwari, Anil, et al.
Published: (2026)

Packing Topological Minors Half-Integrally
by: Liu, Chun-Hung
Published: (2017)

Internally-disjoint directed pendant Steiner trees with three terminal vertices in Cartesian product digraphs
by: Yu, Shanshan, et al.
Published: (2026)

Packing chromatic critical graphs with radius at most 2
by: Gür, Aslıhan, et al.
Published: (2026)

Further Results and Questions on $S$-Packing Coloring of Subcubic Graphs
by: Mortada, Maidoun, et al.
Published: (2024)

Steiner Forest for $H$-Subgraph-Free Graphs
by: Eagling-Vose, Tala, et al.
Published: (2026)

The Dominating 4-Colour Theorem
by: Girão, António, et al.
Published: (2026)

A multidimensional Ramsey Theorem
by: Girão, António, et al.
Published: (2022)

The Excluded Tree Minor Theorem Revisited
by: Dujmović, Vida, et al.
Published: (2023)

Vertex-Based Localization of Turán's Theorem
by: Adak, Rajat, et al.
Published: (2025)

Polynomial Bounds in the Apex Minor Theorem
by: Hendrey, Kevin, et al.
Published: (2025)

Menger's Theorem for Temporal Paths (Not Walks)
by: Ibiapina, Allen, et al.
Published: (2022)

A multipartite analogue of Dilworth's Theorem
by: Fox, Jacob, et al.
Published: (2024)

Size-4 Counterexamples to the Sidon-Extension Conjecture
by: Niu, Tong
Published: (2026)

Extension of the Gyárfás-Sumner conjecture to signed graphs
by: Aubian, Guillaume, et al.
Published: (2025)

Odd-Cycle-Packing-treewidth: On the Maximum Independent Set problem in odd-minor-free graph classes
by: Choi, Mujin, et al.
Published: (2025)

Treewidth 2 in the Planar Graph Product Structure Theorem
by: Distel, Marc, et al.
Published: (2024)

Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
by: Auger, David, et al.
Published: (2024)

Partitioning a Planar Graph into two Triangle-Forests
by: Knauer, Kolja, et al.
Published: (2024)

A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs
by: Zhang, Jiechen
Published: (2026)

The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores Theorem
by: Martínez-Sandoval, Leonardo, et al.
Published: (2019)

Vertex-Based Localization of Erdős-Gallai Theorems for Paths and Cycles
by: Adak, Rajat, et al.
Published: (2025)

Extremal Problems on Forest Cuts and Acyclic Neighborhoods in Sparse Graphs
by: Botler, F., et al.
Published: (2024)

Generalizations of Ferber-Krivelevich and Gallai Theorems on parity of degrees in induced subgraphs
by: Ai, Jiangdong, et al.
Published: (2025)

Polytopes with Bounded Integral Slack Matrices Have Sub-Exponential Extension Complexity
by: Dong, Sally, et al.
Published: (2023)

Cycles of Well-Linked Sets II: an Elementary Bound for the Directed Grid Theorem
by: Hatzel, Meike, et al.
Published: (2026)

The Packing Chromatic Number of the Infinite Square Grid is 15
by: Subercaseaux, Bernardo, et al.
Published: (2023)

An involution for trivariate symmetries of vincular patterns
by: Chen, Joanna N., et al.
Published: (2025)

$S$-Packing Coloring of Cubic Halin Graphs
by: Tarhini, Batoul, et al.
Published: (2022)

A Faster Deterministic Algorithm for Mader's $\mathcal{S}$-Path Packing
by: Iwata, Satoru, et al.
Published: (2024)

Concatenation trees: A framework for efficient universal cycle and de Bruijn sequence constructions
by: Sawada, J., et al.
Published: (2023)

On Realizing Reconfiguration Graphs of Cliques
by: Hoang, Duc A.
Published: (2026)

Efficient $k$-limited Dominating Broadcasts in Product Graphs
by: Bharadwaj, et al.
Published: (2025)

Star colouring and locally constrained graph homomorphisms
by: Antony, Cyriac, et al.
Published: (2023)

Making Walks Count: From Silent Circles to Hamiltonian Cycles
by: Alekseyev, Max A., et al.
Published: (2016)

The Converse of the Real Orthogonal Holant Theorem
by: Young, Ben
Published: (2024)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

Forcing quasirandomness with 4-point permutations
by: Kráľ, Daniel, et al.
Published: (2024)

Extremal minimal bipartite matching covered graphs
by: Mallik, Amit Kumar, et al.
Published: (2024)

Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
by: Martínez, J. A., et al.
Published: (2024)