Imagen de Portada

How to see the forest for the trees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bérczi-Kovács, Erika, Frank, András
Formato:	Preprint
Publicado:	2025
Materias:	Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Interaction between skew-representability, tensor products, extension properties, and rank inequalities
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Matroid products via submodular coupling
por: Bérczi, Kristóf, et al.
Publicado: (2024)

A note on embracing exchange sequences in oriented matroids
por: Bérczi, Kristóf, et al.
Publicado: (2025)

A hierarchy of edge-weight symmetries in perfect matchings
por: Bérczi, Kristóf, et al.
Publicado: (2026)

Cyclic ordering of split matroids
por: Bérczi, Kristóf, et al.
Publicado: (2024)

On approximating the rank of graph divisors
por: Bérczi, Kristóf, et al.
Publicado: (2022)

The Rainbow Arborescence Problem on Cycles
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Testing popularity in linear time via maximum matching
por: Bérczi-Kovács, Erika, et al.
Publicado: (2023)

Quickly excluding an apex-forest
por: Hodor, Jędrzej, et al.
Publicado: (2024)

Blow-up structure of graphs excluding a tree or an apex-tree as a minor
por: Claus, Quentin, et al.
Publicado: (2026)

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Labeling and folding multi-labeled trees
por: Moulton, Vincent, et al.
Publicado: (2025)

Computational complexity of covering regular trees
por: Bok, Jan, et al.
Publicado: (2025)

Conflict-free chromatic index of trees
por: Guo, Shanshan, et al.
Publicado: (2024)

Excluding an apex-forest or a fan as quickly as possible
por: Claus, Quentin, et al.
Publicado: (2026)

On coarse tree decompositions and coarse balanced separators
por: Abrishami, Tara, et al.
Publicado: (2025)

Bipartite Turán number of paths and other trees
por: Bonamy, Marthe, et al.
Publicado: (2025)

On universal graphs for trees and treewidth $k$ graphs
por: Kaul, Neel, et al.
Publicado: (2025)

Tree-partitions and small-spread tree-decompositions
por: Distel, Marc, et al.
Publicado: (2026)

A Caro-Wei bound for induced linear forests in graphs
por: Joret, Gwenaël, et al.
Publicado: (2024)

A complete $t$-intersection theorem for families of spanning trees
por: Iarovikova, Elizaveta, et al.
Publicado: (2025)

Induced matching treewidth and tree-independence number, revisited
por: Alon, Noga, et al.
Publicado: (2025)

Trade-off between spread and width for tree decompositions
por: Bodlaender, Hans L., et al.
Publicado: (2026)

Listing spanning trees of outerplanar graphs by pivot-exchanges
por: Behrooznia, Nastaran, et al.
Publicado: (2024)

Tight bound for the Erdős-Pósa property of tree minors
por: Dujmović, Vida, et al.
Publicado: (2024)

Network fault costs based on minimum leaf spanning trees
por: Goedgebeur, Jan, et al.
Publicado: (2025)

Combinatorial generation via permutation languages. VI. Binary trees
por: Gregor, Petr, et al.
Publicado: (2023)

tinygarden -- A java package for testing properties of spanning trees
por: Dubinsky, Manuel, et al.
Publicado: (2024)

Tree decompositions whose trees are subgraphs: An application of Simon's factorization
por: Bourneuf, Romain, et al.
Publicado: (2026)

Complexity results on the decomposition of a digraph into directed linear forests and out-stars
por: Hörsch, Florian, et al.
Publicado: (2024)

Profile and neighbourhood complexity of graphs excluding a minor and tree-structured graphs
por: Beaudou, Laurent, et al.
Publicado: (2025)

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

Trees and co-trees in planar 3-connected graphs An easier proof via Schnyder woods
por: Ortlieb, Christian, et al.
Publicado: (2024)

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

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two
por: Chakraborty, Dibyayan
Publicado: (2025)

Automorphism groups of Cayley graphs generated by general transposition sets
por: Gijswijt, Dion, et al.
Publicado: (2024)

Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Gathering Information about a Graph by Counting Walks from a Single Vertex
por: Fuhlbrück, Frank, et al.
Publicado: (2024)

Near optimal bounds for weak and strong spatial mixing for the anti-ferromagnetic Potts model on trees
por: Bencs, Ferenc, et al.
Publicado: (2023)