1 citations · 1 across the 6 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2025
Bipartite Turán number of paths and other trees
Marthe Bonamy, Théotime Leclere, Timothé Picavet
We solve a recent question of Caro, Patkós and Tuza by determining the exact maximum number of edges in a bipartite connected graph as a function of the longest path it contains as…
math.CO2025
A polynomial bound on the pathwidth of graphs edge-coverable by shortest paths
Julien Baste, Lucas De Meyer, Ugo Giocanti +2
Dumas, Foucaud, Perez and Todinca (2024) recently proved that every graph whose edges can be covered by shortest paths has pathwidth at most . In this paper, we improve…