Cover Image

A Caro-Wei bound for induced linear forests in graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Joret, Gwenaël, Petit, Robin
Format:	Preprint
Published:	2024
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Neighborhood complexity of planar graphs
by: Joret, Gwenaël, et al.
Published: (2023)

Note on the treewidth of graphs excluding a disjoint union of cycles as a minor
by: Joret, Gwenaël, et al.
Published: (2026)

Improved lower bounds on the maximum size of graphs with girth 5
by: Goedgebeur, Jan, et al.
Published: (2025)

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

Cops and robber in graphs with bounded vertex cover number
by: Bose, Prosenjit, et al.
Published: (2026)

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

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

Pathwidth vs cocircumference
by: Briański, Marcin, et al.
Published: (2023)

Tight bound on treedepth in terms of pathwidth and longest path
by: Hatzel, Meike, et al.
Published: (2023)

Planar graphs in blowups of fans
by: Distel, Marc, et al.
Published: (2024)

Adjacency labelling for proper minor-closed graph classes
by: Dujmović, Vida, et al.
Published: (2026)

Erdős--Pósa property of cycles that are far apart
by: Dujmović, Vida, et al.
Published: (2024)

Cliquewidth and dimension
by: Joret, Gwenaël, et al.
Published: (2023)

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

Integer programs with bounded subdeterminants and two nonzeros per row
by: Fiorini, Samuel, et al.
Published: (2021)

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

On some 2-binomial coefficients of binary words: geometrical interpretation, partitions of integers, and fair words
by: Richomme, Gwenaël
Published: (2025)

A quasi-optimal upper bound for induced paths in sparse graphs
by: Couëtoux, Basile, et al.
Published: (2025)

Coloring bridge-free antiprismatic graphs
by: Robin, Cléophée, et al.
Published: (2024)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Odd coloring graphs with linear neighborhood complexity
by: Davies, James, et al.
Published: (2025)

Long induced paths in sparse graphs and graphs with forbidden patterns
by: Duron, Julien, et al.
Published: (2024)

Strong odd colorings in graph classes of bounded expansion
by: Pilipczuk, Michał
Published: (2025)

Bounded twin-width graphs are polynomially $χ$-bounded
by: Bourneuf, Romain, et al.
Published: (2023)

On expectations and variances in the hard-core model on bounded degree graphs
by: Davies, Ewan, et al.
Published: (2025)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths
by: Baste, Julien, et al.
Published: (2025)

Long induced paths and forbidden patterns: Polylogarithmic bounds
by: Duron, Julien, et al.
Published: (2024)

A polynomial bound on the number of minimal separators and potential maximal cliques in $P_6$-free graphs of bounded clique number
by: Pilipczuk, Marcin, et al.
Published: (2023)

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

On $(n,m)$-chromatic numbers of graphs having bounded sparsity parameters
by: Das, Sandip, et al.
Published: (2023)

List coloring ordered graphs with forbidden induced subgraphs
by: Piecyk, Marta, et al.
Published: (2025)

An optimal chromatic bound for ($P_2+P_3$, gem)-free graphs
by: Char, Arnab, et al.
Published: (2024)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Immersions of large cliques in graphs with independence number 2 and bounded maximum degree
by: Botler, Fábio, et al.
Published: (2025)

Quasi-linear distance query reconstruction for graphs of bounded treelength
by: Bastide, Paul, et al.
Published: (2024)

Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number
by: Jedličková, Nikola, et al.
Published: (2023)

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

Planar induced paths via a decomposition into non-crossing ordered graphs
by: Duron, Julien, et al.
Published: (2025)

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

Integer programs with nearly totally unimodular matrices: the cographic case
by: Aprile, Manuel, et al.
Published: (2024)