Cover Image

Bipartite Turán number of paths and other trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bonamy, Marthe, Leclere, Théotime, Picavet, Timothé
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

$χ$-Boundedness and Neighbourhood Complexity of Bounded Merge-Width Graphs
by: Bonamy, Marthe, et al.
Published: (2025)

Local Constant Approximation for Dominating Set on Graphs Excluding Large Minors
by: Bonamy, Marthe, 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)

On cuts of small chromatic number in sparse graphs
by: Aubian, Guillaume, et al.
Published: (2025)

On graph classes with constant domination-packing ratio
by: Bonamy, Marthe, et al.
Published: (2025)

A Gray code for arborescences of tournaments
by: Bonamy, Marthe, et al.
Published: (2026)

On a recolouring version of Hadwiger's conjecture
by: Bonamy, Marthe, et al.
Published: (2021)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
by: Bonamy, Marthe, et al.
Published: (2020)

On Modular Edge Colourings of Graphs
by: Berthe, Gaétan, et al.
Published: (2025)

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

Bounds on Linear Turán Number for Trees
by: Adak, Rajat, et al.
Published: (2026)

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

Induced Disjoint Paths Without an Induced Minor
by: Aboulker, Pierre, et al.
Published: (2025)

On the Conjecture of the Representation Number of Bipartite Graphs
by: Mozhui, Khyodeno, et al.
Published: (2025)

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

An Upper Bound on the Linear Turán Number of $k$-Crowns
by: Adak, Rajat
Published: (2026)

Distance-based (and path-based) covering problems for graphs of given cyclomatic number
by: Chakraborty, Dibyayan, et al.
Published: (2025)

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

Relation between broadcast domination and multipacking numbers on chordal and other hyperbolic graphs
by: Das, Sandip, et al.
Published: (2023)

New bounds for the optimal density of covering single-insertion codes via the Turán density
by: Pikhurko, Oleg, et al.
Published: (2024)

On the Asymptotics of the Connectivity Probability of Random Bipartite Graphs
by: Chinyaev, Boris
Published: (2025)

Grand zigzag knight's paths
by: Baril, Jean-Luc, et al.
Published: (2024)

On graphs coverable by chubby shortest paths
by: Hatzel, Meike, et al.
Published: (2025)

Ramsey Goodness of paths and unbalanced graphs
by: Botler, Fábio, et al.
Published: (2024)

Orthogonality between acyclic subdigraphs and paths in digraphs
by: Silva, Caroline A. de Paula, et al.
Published: (2026)

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

A lattice on Dyck paths close to the Tamari lattice
by: Baril, Jean-Luc, et al.
Published: (2023)

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

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces
by: Bonamy, Marthe, et al.
Published: (2020)

EPPA numbers of graphs
by: Bradley-Williams, David, et al.
Published: (2023)

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

Non-empty intersection of longest paths in $H$-free graphs
by: Long Jr., James A., et al.
Published: (2023)

Half-integral Erdős-Pósa property for non-null $S$-$T$ paths
by: Chekan, Vera, et al.
Published: (2024)

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

How to see the forest for the trees
by: Bérczi-Kovács, Erika, et al.
Published: (2025)

Hitting all longest paths in $H$-free graphs and $H$-graphs
by: de Lima, Paloma T., et al.
Published: (2025)

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

Cop numbers of periodic graphs
by: De Carufel, Jean-Lou, et al.
Published: (2023)

C sequential optimization numbers
by: Hui, Zile
Published: (2024)

Computing the clique number of tournaments
by: Aubian, Guillaume
Published: (2024)