Imagen de Portada

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bourneuf, Romain, Masaříková, Jana, Nadara, Wojciech, Pilipczuk, Marcin
Formato:	Preprint
Publicado:	2025
Materias:	Combinatorics Discrete Mathematics Data Structures and Algorithms G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

Optimal distance query reconstruction for graphs without long induced cycles
por: Bastide, Paul, et al.
Publicado: (2023)

Bounding $\varepsilon$-scatter dimension via metric sparsity
por: Bourneuf, Romain, et al.
Publicado: (2024)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

SSD Set System, Graph Decomposition and Hamiltonian Cycle
por: Shota, Kan, et al.
Publicado: (2024)

Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
por: Adamson, Duncan, et al.
Publicado: (2023)

Online Bipartite Matching in the Probe-Commit Model
por: Borodin, Allan, et al.
Publicado: (2023)

Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities
por: Ma, Will, et al.
Publicado: (2024)

A Structural Linear-Time Algorithm for Computing the Tutte Decomposition
por: Bourneuf, Romain, et al.
Publicado: (2025)

Treewidth is Polynomial in Maximum Degree on Weakly Sparse Graphs Excluding a Planar Induced Minor
por: Bonnet, Édouard, et al.
Publicado: (2023)

Color-Constrained Arborescences in Edge-Colored Digraphs
por: Ardra, P. S., et al.
Publicado: (2025)

Coarse Balanced Separators in Fat-Minor-Free Graphs
por: Bonnet, Édouard, et al.
Publicado: (2026)

On Relaxation of Dominant Sets
por: Koster, Max
Publicado: (2022)

Weisfeiler-Leman on graphs of small twin-width
por: Heinrich, Irene, et al.
Publicado: (2026)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Output-sensitive Complexity of Multi-Objective Integer Network Flow Problems
por: Könen, David, et al.
Publicado: (2023)

Computing parameters that generalize interval graphs using restricted modular partitions
por: Bonomo-Braberman, Flavia, et al.
Publicado: (2025)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
por: Nishimura, Yuki, et al.
Publicado: (2025)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

Searching in trees with $k$-up-modular cost functions
por: Szyfelbein, Michał
Publicado: (2025)

A Polynomial Kernel for Deletion to the Scattered Class of Cliques and Trees
por: Jacob, Ashwin, et al.
Publicado: (2024)

Max Weight Independent Set in sparse graphs with no long claws
por: Abrishami, Tara, et al.
Publicado: (2023)

A Polynomial-Time Approximation Algorithm for Complete Interval Minors
por: Bourneuf, Romain, et al.
Publicado: (2025)

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

Deterministic Minimum Steiner Cut in Maximum Flow Time
por: Ding, Matthew, et al.
Publicado: (2023)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
por: Eiben, Eduard, et al.
Publicado: (2023)

Forward-backward Contention Resolution Schemes for Fair Rationing
por: Ma, Will, et al.
Publicado: (2025)

A polynomial-time algorithm for recognizing high-bandwidth graphs
por: Varona, Luis M. B.
Publicado: (2026)

Optimal Path Partitions in Subcubic and Almost-subcubic Graphs
por: Masařík, Tomáš, et al.
Publicado: (2026)

Random Schreier graphs as expanders
por: Caillat-Grenier, Geoffroy
Publicado: (2023)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
por: Bencs, Ferenc, et al.
Publicado: (2025)

Variants of the Gyàrfàs-Sumner Conjecture: Oriented Trees and Rainbow Paths
por: Basavaraju, Manu, et al.
Publicado: (2021)

Alon-Tarsi Number of Some Regular Graphs
por: Prajnanaswaroopa, S.
Publicado: (2023)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
por: Bonnet, Édouard, et al.
Publicado: (2026)

A Polynomial Coreset for Furthest Neighbor in Planar Metrics
por: Kluk, Kacper, et al.
Publicado: (2026)

Arborescences and Shortest Path Trees when Colors Matter
por: Ardra, P. S., et al.
Publicado: (2024)

The Polymatroid Representation of a Greedoid, and Associated Galois Connections
por: Streit, Robert P., et al.
Publicado: (2024)

Monotonicity of the cops and robber game for bounded depth treewidth
por: Adler, Isolde, et al.
Publicado: (2024)